Suffix trees for inputs larger than main memory

Information Systems

Volumn 36, Issue 3, 2011, Pages 644-654

  Barsky, Marina ^a   Stege, Ulrike ^a   Thomo, Alex ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Full text indexes; String databases; Suffix trees

Indexed keywords

BIOLOGICAL SEQUENCES; FULL-TEXT INDEXES; HUMAN GENOMES; INPUT SEQUENCE; INPUT STRING; MAIN MEMORY; PRACTICAL ALGORITHMS; PROOF OF CONCEPT; RANDOM ACCESS; REAL-LIFE APPLICATIONS; SINGLE MACHINES; STRING DATABASE; STRING-SEARCHING; SUFFIX TREES;

ALGORITHMS; DATA STRUCTURES; DNA SEQUENCES; LAKES; RANDOM ACCESS STORAGE;

TREES (MATHEMATICS);

EID: 79951553095     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2010.11.001     Document Type: Conference Paper

References (30)

1. M. Barsky, U. Stege, A. Thomo, C. Upton, A new method for indexing genomes using on-disk suffix trees, in: Proceedings of CIKM 2008, 2008, pp. 649658.
2. D. Benson, I. Karsch-Mizrachi, D. Lipman, J. Ostell, D. Wheeler, GenBank, Nucleic Acids Research 34 (2006).
3. W.I. Chang, and E.L. Lawler Sublinear approximate string matching and biological applications Algorithmica 12 4/5 1994 327 344
4. R. Dementiev, J. Krkkinen, J. Mehnert, P. Sanders, Better external memory suffix array construction, in: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, 2005.
5. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan On the sorting-complexity of suffix tree construction Journal of the ACM 47 6 2000 987 1011
6. P. Ferragina, and R. Grossi The String B-Tree: a new data structure for string search in external memory and its applications Journal of the ACM 46 2 1999 236 280
7. H. Garcia-Molina, J.D. Ullman, and J.D. Widom Database System Implementation 1999 Prentice-Hall Inc.
8. A. Ghoting, K. Makarychev, Serial and parallel methods for I/O efficient suffix tree construction, in: Proceedings of SIGMOD 2009, pp. 827840.
9. D. Gusfield Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997 Cambridge University Press
10. E. Hunt, M.P. Atkinson, and R.W. Irving A database index to large biological sequences The VLDB Journal 7 3 2001 139 148
11. J. Krkkinen, P. Sanders, and S. Burkhardt Linear work suffix array construction Journal of the ACM 53 6 2006 918 936 (Pubitemid 46276961)
12. S. Kurtz, A. Phillippy, and A.L. Delcher Versatile and open software for comparing large genomes Genome Biology 5 R12 2004
13. S. Kurtz, and C. Schleiermacher EPuter: fast computation of maximal repeats in complete genomes Bioinformatics 15 1999 426 427 (Pubitemid 29312632)
14. U. Manber, and E. Myers Suffix arrays: a new method for on-line string searches SIAM Journal of Computing 22 5 1993 935 948
15. G. Manzini, Two space saving tricks for linear time LCP array computation, in: SWAT, Lecture Notes in Computer Science, vol. 3111, 2004, pp. 372383.
16. E.M. McCreight A space-economical suffix tree construction algorithm Journal of the ACM 23 2 1976 262 272
17. U. Meyer, P. Sanders, J.F. Sibeyn, Algorithms for Memory Hierarchies, Advanced Lectures, Lecture Notes in Computer Science, vol. 2625, 2003.
18. G. Navarro, R. Baeza-Yates, A new indexing method for approximate string matching, Technical Report TR/DCC-98-14, Department of Computer Science, University of Chile, 1998.
19. B. Phoophakdee, M.J. Zaki, Genome-scale disk-based suffix tree indexing, in: ACM SIGMOD International Conference on Management of Data, 2007.
20. B. Phoophakdee, M.J. Zaki, Trellis: an effective approach for indexing massive sequence, in: Pacific Symposium on Biocomputing, 2008.
21. W. Smyth Computing Patterns in Strings 2003 Addison-Wesley
22. S. Tata, R.A. Hankins, J.M. Patel, Practical suffix tree construction, in: Proceedings of the 30th VLDB Conference, 2004, pp. 3647.
23. Y. Tian, S. Tata, R. Hankins, and J. Patel Practical methods for constructing suffix trees The VLDB Journal 14 3 2005 281 299 (Pubitemid 41396781)
24. J. Yang, W. Wang, Y. Xia, P.S. Yu, Accelerating approximate subsequence search on large protein sequence databases, CSB, in: Proceedings of the IEEE Conference on Bioinformatics, 2002, p. 207.
25. USCS Genome Browser: 〈 hgdownload.cse.ucsc.edu/downloads.html 〉.
26. NCBI Genebank overview: 〈 http://www.ncbi.nlm.nih.gov/Genbank/ 〉.
27. Source code for TDD: 〈 www.eecs.umich.edutdddownload.html 〉.
28. Source code for TrellisSB: 〈 www.cs.rpi.edu/∼zaki/software/ trellis 〉.
29. A lightweight suffix-sorting library. 〈 http://code.google.com/p/ libdivsufsort/ 〉.
30. 2ST. 〈 http://webhome.cs.uvic.ca/ ∼mgbarsky/bbstpapercode.html 〉.