Practical methods for constructing suffix trees

VLDB Journal

Volumn 14, Issue 3, 2005, Pages 281-299

  Tian, Yuanyuan ^a   Tata, Sandeep ^a   Hankins, Richard A ^b   Patel, Jignesh M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Sequence matching; Suffix tree construction

Indexed keywords

EID: 25844465842     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-005-0154-8     Document Type: Article

References (55)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2, 53-86 (2004)
2. Aluru, S.: Suffix Trees and Suffix Arrays, Handbook of Data Structures and Applications. CRC Press (2004)
3. Andersson, A., Nilsson, S.: Efficient implementation of suffix trees. Software: Pract Exp. 25(2), 129-141 (1995)
4. Apostolico, A., Szpankowski, W.: Self-alignments in words and their applications. J. Algorithms 13(3), 446-467 (1992)
5. Apweiler, R., Bairoch, A., Wu, C.H., Barker, W., Boeckmann, B., Ferro, S., Gasteiger, E., Huang, H., Lopez, R., Magrane, M., Martin, M.J., Natale, D., O'Donovan, A.C., Redaschi, N., Yeh, L.L.: Uniprot: The universal protein knowledgebase. Nucl. Acids Res. 32(D), 115-119 (2004)
6. Atkinson, M., Jordan, M.: Providing orthogonal persistence for Java. In Proceedings of the 12th European Conference on Object-Oriented Programming, pp. 383-395 (1998)
7. Bedathur, S.J., Haritsa, J.R.: Engineering a fast online persistent suffix tree construction. In: Proceedings of the 20th International Conference on Data Engineering, pp. 720-731 (2004)
8. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360-369 (1997)
9. Blumer, A., Ehrenfeucht, A., Haussler, D.: Average sizes of suffix trees and DAWGs. Discrete Applied Mathematics 24(1), 37-45 (1989)
10. Carvalho, A., Freitas, A., Oliveira, A., Sagot, M.-F.: A parallel algorithm for the extraction of structured motifs. In Proceedings of the 2004 ACM Symposium on Applied Computing, pp. 147-153 (2004)
11. Cheng, L.-L., Cheung, D., Yiu, S.-M.: Approximate string matching in DNA sequences. In: Proceeings of the 8th International Conference on Database Systems for Advanced Applications, pp. 303-310 (2003)
12. Cheung, C.-F., Yu, J.X., Lu, H.: Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering 17(1), 90-105 (2005)
13. Clifford, R., Sergot, M.J.: Distributed and paged suffix trees for large genetic databases. In: Proceedings of 14th Annual Symposium on Combinatorial Pattern Matching, pp. 70-82, 2003.
14. Crauser, A., Ferragina, P.: A theoretical and experimental study on the construction of suffix arrays in external memory and its applications. Algorithmica 32(1), 1-35 (2002)
15. Deep-Shallow Suffix Array and BWT Construction Algorithms. http://www.mfn.unipmn.it/~manzini/lightweight/.
16. Delcher, A., Kasif, S., Fleischmann, R., Peterson, J., White, O., Salzberg, S.: Alignment of whole genomes. Nucleic Acids Res. 27(11), 2369-2376 (1999)
17. Delcher, A., Phillippy, A., Carlton, J., Salzberg, S.: Fast algorithms for large-scale genome alignment and comparision. Nucleic Acids Res. 30(11), 2478-2483 (2002)
18. Dementiev, R., Kärkkäinen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (2005)
19. Devroye, L., Szpankowski, W., Rais, B.: A note on the height of suffix trees. SIAM J. Comput. 21(1), 48-53 (1992)
20. External Memory Suffix Array Construction Project, http://i10www.ira.uka. de/dementiev/esuffix/docu/index.html.
21. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 137-143. IEEE Computer Society (1997)
22. Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of The ACM 47(6), 987-1011 (2000)
23. GenBank, NCBI, 2004. http://www.ncbi.nlm.nih.gov/GenBank.
24. Giegerich, R., Kurtz, S.: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica 19(3), 331-353 (1997)
25. Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Soft. Pract. Exp. 33(11), 1035-1049 (2003)
26. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)
27. Heumann, K., Mewes, H.-W.: The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices. In: Proceedings of the 3rd South American Workshop on String Processing, pp. 101-115 (1996)
28. Hunt, E., Atkinson, M.P., Irving, R.W.: A database index to large biological sequences. The VLDB J. 7(3), 139-148 (2001)
29. Intel Corporation. The IA-32 Intel Architecture Optimization Reference Manual. Intel (Order Number 248966) (2004)
30. Intel Corporation. The IA-32 Intel Architecture Software Developer's Manual: System Programming Guide, vol. 3. Intel (Order Number 253668) (2004)
31. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Proceedings of the 13th International Conference on Automata, Languages and Programming, pp. 943-955 (2003)
32. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, pp. 181-192 (2001)
33. Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 186-199 (June 2003)
34. Ko, P., Aluru, S.: Space efficient linear-time construction of suffix arrays. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 200-210 (June 2003)
35. Kurtz, S.: Reducing space requirement of suffix trees. Soft: Pract. Exp. 29(13), 1149-1171 (1999)
36. Kurtz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: REPuter: The manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res. 29, 4633-4642 (2001)
37. Kurtz, S., Phillippy, A., Delcher, A., Smoot, M., Shumway, M., Antonescu, C., Salzberg, S.: Versatile and open software for comparing large genomes. Genome Bio. 5(R12) (2004)
38. Manzini, G.: Two space saving tricks for linear time LCP array computation. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, pp. 372-383 (2004)
39. Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40(1), 33-50 (2004)
40. McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of The ACM 23(2), 262-272 (1976)
41. Meek, C., Patel, J.M., Kasetty, S.: Oasis: An online and accurate technique for local-alignment searches on biological sequences. In Proceedings of 29th International Conference on Very Large Data Bases, pp. 910-921 (2003)
42. Navarro, G., Baeza-Yates, R., Tariho, J.: Indexing methods for approximate string matching. IEEE Data Eng. Bull. 24(4), 19-27 (2001)
43. Patel, J.M.: The role of declarative querying in bioinformatics. OMICS: J. Integr. Biol. 7(1), 89-92 (2003)
44. Pettersson, M.: Perfctr: Linux performance montioring counters driver, http://user.it.uu.se/~mikpe/linux/perfctr.
45. Project Gutenberg, http://www.gutenberg.net.
46. Schurmann, K.-B., Stoye, J.: Suffix-tree construction and storage with limited main memory. Technical Report 2003-06, Univeristy of Bielefeld, Germany (2003)
47. STXXL Library. http://i10www.ira.uka.de/dementiev/stxxl.shtml.
48. Szpankowski, W.: Average-Case Analysis of Algorithms on Sequences. John Wiley and Sons (2001)
49. Tata, S., Hankins, R.A., Patel, J.M.: Practical suffix tree construction. In: Proceedings of 30th International Conference on Very Large Data Bases, pp. 36-47 (2004)
50. The Growth of GenBank, NCBI, 2004. http://www.ncbi.nlm.nih.gov/Genbank/ genbankstats.html.
51. The MUMmer Software. http://www.tigr.org/soilware/mummer/.
52. Ukkonen, E.: Constructing suffix-trees on-line in linear time. In Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture: Information Processing, pp. 484-492 (1992)
53. Vitter, J.S., Shriver, M.: Algorithms for parallel memory: Two-level memories. Algorithmica 12, 110-147 (1994)
54. Weiner, P.: Linear pattern matching algorithms. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory, pp. 1-11 (1973)
55. Yona, S., Tsadok, D.: ANSI C implementation of a suffix tree. http://cs.haifa.ac.il/~shlomo/suffix_tree.