Serial and parallel methods for I/O efficient suffix tree construction

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 827-840

  Ghoting, Amol ^a   Makarychev, Konstantin ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Disk based; Externalmemory; Genome indexing; Parallel; Sequence indexing; Suffix tree

Indexed keywords

ALGORITHM DESIGN; BIOLOGICAL SEQUENCE DATA; COLLECTIVE COMMUNICATIONS; DATA COLLECTION; DISK I/O; DISK-BASED; EMERGING APPLICATIONS; HUMAN GENOMES; INPUT STRING; LOCALITY OF REFERENCE; MAIN MEMORY; MASSIVELY PARALLEL SYSTEMS; MEMORY FOOTPRINT; ORDERS OF MAGNITUDE; PARALLEL METHOD; PARALLEL SCALABILITY; PARALLELIZATIONS; PHYSICAL MEMORY; PROCESSOR SYSTEMS; STORAGE TECHNOLOGY; STRING PROCESSING; SUFFIX-TREES; WORKING SET;

DATA STRUCTURES; DATABASE SYSTEMS; DISKS (STRUCTURAL COMPONENTS); GENES; INDEXING (OF INFORMATION); TIME SERIES;

PARALLEL ALGORITHMS;

EID: 70849103704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559931     Document Type: Conference Paper

References (29)

1. S. Bedathur and J. Haritsa. Engineering a fast online persistent suffix tree construction. In Proceedings of the IEEE International Conference on Data Engineering, 2004.
2. S. Bedathur and J. Haritsa. Search optimized suffix tree storage for biological applications. In Proceedings of the IEEE International Conference on High Performance Computing, 2005.
3. N. Bray, I. Dubchak, and L. Pachter. AVID: A global alignment program. Genome Research, 13(1), 2003.
4. A. Brown. Constructing genome scale suffix trees. In Proceedings of the Asia-Pacific Bioinformatics Conference, 2004.
5. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, 1994.
6. A. Carvalho, A. Freitas, A. Oliveira, and M. Sagot. Efficient extraction of structured motifs using box links. In Proceedings of the 11th Conference on String Processing and Information Retrieval, 2004.
7. W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. Algorithmica, 12(4/5), 1994.
8. C. Cheung, J. Yu, and H. Lu. Constructing suffix trees for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering, 17(1), 2005.
9. R. Clifford and M. Sergot. Distributed and paged suffix trees for large genetic databases. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2003.
10. A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White, and S. Salzberg. Alignment of whole genomes. Nucleic Acids Res., 27(11), 1999.
11. A. Delcher, A. Phillippy, J. Carlton, and S. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res., 30(1), 2002.
12. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In Proceedings of the Annual Symposium on Foundations of Computer Science, 1998.
13. D. Gusfield. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, Cambridge, 1997.
14. 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), 2004.
15. E. Hunt, M. Atkinson, and R. Irving. A database index to large biological sequences. In Proceedings of 27th International Conference on Very Large Databases, 2001.
16. R. Japp. The top-compressed suffix tree: A disk resident index for large sequences. In Proceedings of the Bioinformatics Workshop at the 21st Annual British National Conference on Databases, 2004.
17. S. Kurtz, J. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. Reputer: The manifold applications of repeat analysis on a genome scale. Nucleic Acids Res., 29, 2001.
18. S. Kurtz, A. Phillippy, A. Delcher, M. Smoot, M. Shumway, C. Antonescu, and S. Salzberg. Versatile and open software for comparing large genomes. Genome Bio., 5(R12), 2004.
19. E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2), 1976.
20. th International Conference on Very Large Databases,2003.
21. NCBI. Public collections of dna and rna sequence reach 100 gigabases. http://www.nlm.nih.gov/news/press-releases/dna-rna-100-gig.html.
22. B. Phoophakdee and M. Zaki. Genome-scale disk-based suffix tree indexing. In Proceedings of the ACM International Conference on Management of Data, 2007.
23. B. Phoophakdee and M. Zaki. Trellis+: An effective approach for indexing massive sequences. In Proceedings of the Pacific Symposium on Biocomputing, 2008.
24. K. Schurmann and J. Stoye. Suffix tree construction and storage with limited main memory. Technical report, Universitat Bielefeld, 2003.
25. Y. Tian, S. Tata, R. Hankins, and J. Patel. Practical methods for constructing suffix trees. VLDB Journal, 14(3), 2005.
26. E. Ukkonen. Constructing suffix trees on-line in linear time. In Proceedings of the IFIP 12th Work Computer Congress on Algorithms, Software, Architecture: Information Processing, 1992.
27. P. Weiner. Linear pattern matching algorithms. In Proceedings of 14th Annual Symposium on Switch and Automata Theory, 1973.
28. D. Yankov, E. Keogh, and U. Rebbapragada. Disk-aware discord discovery: Finding unusual time series in tera-byte sized datasets. In Proceedings of the IEEE International Conference on Data Mining, 2007.
29. O. Zamir and O. Etzioni. Web document clustering: a feasibility demonstration. In Proceedings of 21th International Conference on Research and Development in Information Retrieval, 1998.