I/O efficient algorithms for serial and parallel suffix tree construction

ACM Transactions on Database Systems

Volumn 35, Issue 4, 2010, Pages

  Ghoting, Amol ^a   Makarychev, Konstantina ^a  

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

Author keywords

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

Indexed keywords

DISK-BASED; EXTERNAL MEMORY; GENOME INDEXING; PARALLEL; SEQUENCE INDEXING; SUFFIX-TREES;

ALGORITHMS; DATA STRUCTURES; DISKS (STRUCTURAL COMPONENTS); GENES; INDEXING (OF INFORMATION); SUPERCOMPUTERS; TIME SERIES;

TREES (MATHEMATICS);

EID: 78650636112     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1862919.1862922     Document Type: Conference Paper

References (34)

1. APOSTOLICO, A., ILIOPOULOS, C., LANDAU, G., SCHIEBER, B., AND VISHKIN, U. 1988. Parallel construction of a suffix tree with applications. Algorithmica 3, 1-4.
2. BEDATHUR, S. AND HARITSA, J. 2004. Engineering a fast online persistent suffix tree construction. In Proceedings of the IEEE International Conference on Data Engineering.
3. BEDATHUR, S. ANDHARITSA, J. 2005. Search optimized suffix tree storage for biological applications. In Proceedings of the IEEE International Conference on High Performance Computing.
4. BRAY, N., DUBCHAK, I., AND PACHTER, L. 2003. AVID: A global alignment program. Genome Res. 13, 1.
5. BROWN, A. 2004. Constructing genome scale suffix trees. In Proceedings of the Asia-Pacific Bioinformatics Conference.
6. BURROWS, M. AND WHEELER, D. 1994. A block sorting lossless data compression algorithm. Tech. rep., Digital Equipment Corporation.
7. CARVALHO, A., FREITAS, A.,OLIVEIRA, A., AND SAGOT,M. 2004. Efficient extraction of structured motifs using box links. In Proceedings of the 11th Conference on String Processing and Information Retrieval.
8. CHANG, W. AND LAWLER, E. 1994. Sublinear approximate string matching and biological applications. Algorithmica 12, 4/5.
9. CHEUNG, C., YU, J., AND LU, H. 2005. Constructing suffix trees for gigabyte sequences with megabyte memory. IEEE Trans. Knowl. Data Eng. 17, 1.
10. CLIFFORD, R. AND SERGOT,M. 2003. Distributed and paged suffix trees for large genetic databases. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching.
11. DELCHER, A.,KASIF, S.,FLEISCHMANN, R.,PETERSON, J.,WHITE, O., AND SALZBERG, S. 1999. Alignment of whole genomes. Nucleic Acids Res. 27, 11.
12. DELCHER, A., PHILLIPPY, A., CARLTON, J., AND SALZBERG, S. 2002. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. 30, 1.
13. FARACH-COLTON, M., FERRAGINA, P., AND MUTHUKRISHNAN, S. 1998. Overcoming the memory bottleneck in suffix tree construction. In Proceedings of the Annual Symposium on Foundations of Computer Science.
14. FARACH-COLTON, M., FERRAGINA, P., AND MUTHUKRISHNAN, S. 2000. On the sorting-complexity of suffix tree construction. J. ACM 47, 6, 987-1011.
15. FERRAGINA, P., GAGIE, T., AND MANZINI, G. 2010. Lightweight data indexing and compression in external memory. In Proceedings of the Conference on Theoretical Informatics (LATIN'10), A. Lpez-Ortiz, Ed., Lecture Notes in Computer Science, vol. 6034. Springer Berlin, 697-710.
16. GHOTING, A. AND MAKARYCHEV, K. 2009. Serial and parallel methods for I/O efficient suffix tree construction. In Proceedings of the ACM International Conference on Management of Data.
17. GUSFIELD, D. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK.
18. GUSFIELD, D. AND STOYE, J. 2004. Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69, 4.
19. HARIHARAN, R. 1994. Optimal parallel suffix tree construction. In Proceedings of the Symposium on Theory of Computing.
20. HUNT, E., ATKINSON, M., AND IRVING, R. 2001. A database index to large biological sequences. In Proceedings of 27th International Conference on Very Large Databases.
21. JAPP, R. 2004. 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.
22. KURTZ, S., CHOUDHURI, J., OHLEBUSCH, E., SCHLEIERMACHER, C., STOYE, J., AND GIEGERICH, R. 2001. Reputer: The manifold applications of repeat analysis on a genome scale. Nucleic Acids Res. 29.
23. KURTZ, S.,PHILLIPPY, A.,DELCHER, A., SMOOT, M.,SHUMWAY, M.,ANTONESCU, C., AND SALZBERG, S. 2004. Versatile and open software for comparing large genomes. Genome Bio. 5, R12.
24. MCCREIGHT, E. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 2.
25. MEEK, C., PATEL, J., AND KASETTY, S. 2003. Oasis: An online and accurate technique for localalignment searches on biological sequences. In Proceedings of 29th International Conference on Very Large Databases.
26. NCBI. Public collections of DNA and RNA sequence reach 100 gigabases. http://www.nlm.nih.gov/news/press-releases/dna-rna-100-gig.html.
27. PHOOPHAKDEE, B. AND ZAKI,M. 2007. Genome-scale disk-based suffix tree indexing. In Proceedings of the ACM International Conference on Management of Data.
28. PHOOPHAKDEE, B. AND ZAKI, M. 2008. Trellis+: An effective approach for indexing massive sequences. In Proceedings of the Pacific Symposium on Biocomputing.
29. RUBIN, G. M., YANDELL, M. D.,WORTMAN, J. R., GABOR MIKLOS, G. L., NELSON, C. R., HARIHARAN, I. K., FORTINI, M. E., LI, P. W.,APWEILER, R., FLEISCHMANN, W.,CHERRY, J. M.,HENIKOFF, S., SKUPSKI, M. P., MISRA, S., ASHBURNER, M., BIRNEY, E., BOGUSKI, M. S., BRODY, T., BROKSTEIN, P., CELNIKER, S. E., CHERVITZ, S. A., COATES, D., CRAVCHIK, A., GABRIELIAN, A., GALLE, R. F., GELBART, W. M., GEORGE, R. A., GOLDSTEIN, L. S., GONG, F., GUAN, P., HARRIS, N. L., HAY, B. A., HOSKINS, R. A., LI, J., LI, Z., HYNES, R. O., JONES, S. J., KUEHL, P. M., LEMAITRE, B., LITTLETON, J. T.,MORRISON, D. K.,MUNGALL, C., O'FARRELL, P. H., PICKERAL, O. K., SHUE, C., VOSSHALL, L. B., ZHANG, J., ZHAO, Q., ZHENG, X. H., ZHONG, F., ZHONG, W., GIBBS, R., VENTER, J. C., ADAMS, M. D., AND LEWIS, S. 2000. Comparative genomics of the eukaryotes. Science 287, 5461.
30. SCHURMANN, K. AND STOYE, J. 2003. Suffix tree construction and storage with limited main memory. Tech. rep., Universitat Bielefeld.
31. TIAN, Y., TATA, S.,HANKINS, R., AND PATEL, J. 2005. Practical methods for constructing suffix trees. VLDB J. 14, 3.
32. UKKONEN, E. 1992. Constructing suffix trees on-line in linear time. In Proceedings of the IFIP 12th Work Computer Congress on Algorithms, Software, Architecture: Information Processing.
33. WEINER, P. 1973. Linear pattern matching algorithms. In Proceedings of 14th Annual Symposium on Switch and Automata Theory.
34. ZAMIR, O. AND ETZIONI, O. 1998. Web document clustering: a feasibility demonstration. In Proceedings of 21st International Conference on Research and Development in Information Retrieval.