title: Suffix tree searcher: exploration of common substrings in large DNA sequence sets.
abstract: BACKGROUND
  Large DNA sequence data sets require special bioinformatics tools to search and compare them. Such tools should be easy to use so that the data can be easily accessed by a wide array of researchers. In the past, the use of suffix trees for searching DNA sequences has been limited by a practical need to keep the trees in RAM. Newer algorithms solve this problem by using disk-based approaches. However, none of the fastest suffix tree algorithms have been implemented with a graphical user interface, preventing their incorporation into a feasible laboratory workflow.
  
  
  RESULTS
  Suffix Tree Searcher (STS) is designed as an easy-to-use tool to index, search, and analyze very large DNA sequence datasets. The program accommodates very large numbers of very large sequences, with aggregate size reaching tens of billions of nucleotides. The program makes use of pre-sorted persistent "building blocks" to reduce the time required to construct new trees. STS is comprised of a graphical user interface written in Java, and four C modules. All components are automatically downloaded when a web link is clicked. The underlying suffix tree data structure permits extremely fast searching for specific nucleotide strings, with wild cards or mismatches allowed. Complete tree traversals for detecting common substrings are also very fast. The graphical user interface allows the user to transition seamlessly between building, traversing, and searching the dataset.
  
  
  CONCLUSIONS
  Thus, STS provides a new resource for the detection of substrings common to multiple DNA sequences or within a single sequence, for truly huge data sets. The re-searching of sequence hits, allowing wild card positions or mismatched nucleotides, together with the ability to rapidly retrieve large numbers of sequence hits from the DNA sequence files, provides the user with an efficient method of evaluating the similarity between nucleotide sequences by multiple alignment or use of Logos. The ability to re-use existing suffix tree pieces considerably shortens index generation time. The graphical user interface enables quick mastery of the analysis functions, easy access to the generated data, and seamless workflow integration.
authors: David
authors: D
authors: Minkley
authors: Michael J
authors: MJ
authors: Whitney
authors: Song-Han
authors: SH
authors: Lin
authors: Marina G
authors: MG
authors: Barsky
authors: Chris
authors: C
authors: Kelly
authors: Department of Biochemistry and Microbiology, University of Victoria, Ring Road, Victoria, BC V8W 3P6, Canada. cupton@uvic.ca.
authors: Chris
authors: C
authors: Upton
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D019295:Computational Biology; D004247:DNA / Q000032:analysis / Q000235:genetics*; D004926:Escherichia coli / Q000235:genetics; D015894:Genome, Human; D006801:Humans; D008969:Molecular Sequence Data; D010942:Plant Viruses / Q000235:genetics; D016415:Sequence Alignment; D012984:Software; D014584:User-Computer Interface
chemical_list: D004247:DNA