Genome-scale disk-based suffix tree indexing

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 833-844

  Phoophakdee, Benjarath ^a   Zaki, Mohammed J ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

Disk based; External memory; Genome scale; Sequence indexing; Suffix tree

Indexed keywords

DISK BASED SUFFIX TREE INDEXING; EXTERNAL MEMORY; SEQUENCE INDEXING;

ALGORITHMS; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; PROBLEM SOLVING; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 35448952633     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247572     Document Type: Conference Paper

References (31)

1. S. Bedathur and J. Haritsa. Engineering a fast online persistent suffix tree construction. In 20th Int'l Conference on Data Engineering, 2004.
2. S. Bedathur and J. Haritsa, Search-optimized suffix-tree storage for biological applications. In IEEE Int'l Conf. on High Performance Computing, 2005.
3. N. Bray, I. Dubchak, and L. Pachter. AVID: A global alignment program. Genome Research, 13(1):97-102, 2003.
4. A. Brown. Constructing genome scale suffix trees. In 2nd Asia-Pacific Bioinformatics Conference, 2004.
5. A. Carvalho, A. Freitas, A. Oliveira, and M. Sagot. Efficient extraction of structured motifs using box-links. In 11th Conference, on String Processing and Information Retrieval, 2004.
6. W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. Algorithmica, 12(4/5):327-344, 1994.
7. C.-F. Cheung, J. Yu, and H. Lu. Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering, 17(1):90-105, 2005.
8. R. Clifford and M. Sergot. Distributed and paged suffix trees for large genetic databases. In 14th Annual Symp. on Combinatorial Pattern Matching, 2003.
9. A. Crauser and P. Ferragina. A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica, 32:1-35, 2002.
10. A. Delcher, A. Phillippy, J. Carlton, and S. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Research, 30(11):2478-2483, 2002.
11. R. Dementiev, J. Kärkkäinen, J. Mehnert, and P. Sanders. Better external memory suffix array construction. In Workshop on Algorithm Engineering and Experiments, 2005.
12. M. Farach-Colton. Optimal suffix tree construction with large alphabets. In 39th Annual Symposium on Foundations of Computer Science, 1997.
13. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In 39th Annual Symp. on Foundations of Computer Science, 1998.
14. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. Journal of the ACM, 47(6):987-1011, 2000.
15. 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):236-280, 1999.
16. R. Giegerich, S. Kurtz, and J. Stoye. Efficient implementation of lazy suffix trees. Software Practice & Experience, 33(11):1035-1049, 2003.
17. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
18. D. Gusfield. Suffix trees (and relatives) come of age in bioinformatics. In IEEE Computer Society Bioinformatics Conference, 2002.
19. D. Gusfield and J. Stoye. Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of Computer and System Sciences, 69(4):525-546, 2004.
20. K. Heumann and H. W. Mewes. The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices. In 3rd South American Workshop on String Processing, 1996.
21. M. Höhl, S. Kurtz, and E. Ohlebusch. Efficient multiple genome alignment. Bioinformatics, 18(supplement 1):312-320, 2002.
22. E. Hunt, M. Atkinson, and R. Irving. A database index to large biological sequences. In 27th Int'l Conference on Very Large Data Bases, 2001.
23. R. Japp. The top-compressed suffix tree: A disk-resident index for large seqeuences. In Bioinformatics Workshop, 21st Annual British National Conference On Databases, 2004.
24. E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, Apr. 1976.
25. NCBI. Public collections of dna and rna, sequence reach 100 gigabases. http://www.nlm.nih.gov/news/press_releases/dna_ma_100_gig.html, 2005.
26. K.-B. Schürmann and J. Stoye. Suffix tree construction and storage with limited main memory. Technical Report 2003-06, Universität Bielefeld, 2003.
27. S. Tata, R. Hankins, and J. Patel. Practical suffix tree construction. In 30th Int'l Conference on Very Large Data Bases, 2004.
28. Y. Tian, S. Tata, R. Hankins, and J. Patel. Practical methods for constructing suffix trees. VLDB Journal, 14(3):281-299, 2005.
29. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3), 1995.
30. E. Ukkonen and J. Kärkkäinen. Sparse suffix trees. In 2nd Annual Int'l Conference on Computing and Combinatorics, 1996.
31. P. Weiner. Linear pattern matching algorithms. In 14th IEEE Symp. on Switching and Automata Theory, 1973.