A survey of practical algorithms for suffix tree construction in external memory

Software - Practice and Experience

Volumn 40, Issue 11, 2010, Pages 965-988

  Barsky, M ^a   Stege, U ^a   Thomo, A ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

external memory algorithms; string index; suffix tree

Indexed keywords

ALGORITHMIC APPROACH; EXTERNAL MEMORY; EXTERNAL MEMORY ALGORITHMS; MAIN MEMORY; PRACTICAL ALGORITHMS; SECONDARY STORAGE; SOFTWARE-BASED; STRING INDEX; SUFFIX-TREES;

ALGORITHMS;

EID: 78249256369     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.960     Document Type: Review

References (44)

1. McCreight EM,. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 1976; 23 (2): 262-272.
2. Morrison D,. PATRICIA-Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM 1968; 15 (4): 514-534.
3. Weiner P,. Linear pattern matching algorithm. Fourteenth Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, U.S.A., 1973; 1-11.
4. Gusfield D,. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press: Cambridge, 1997; 122-207.
5. Smyth W,. Computing Patterns in Strings. Addison-Wesley: Reading, MA, 2003; 136-137.
6. NCBI Genebank overview. Available at: http://www.ncbi.nlm.nih.gov/ Genbank/ [February 2008].
7. Benson D, Karsch-Mizrachi I, Lipman D, Ostell J, Wheeler D,. GenBank. Nucleic Acids Research 2006; 34: D16-D20.
8. Vitter J,. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys 2001; 33 (2): 209-271.
9. Vitter J, Shriver M,. Algorithms for parallel memory: Two-level memories. Algorithmica 1994; 12: 110-147.
10. Crauser A, Ferragina P,. A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica 2002; 32 (1): 1-35.
11. Knuth D,. The Art of Computer Programming; Volume 3: Sorting and Searching (2nd edn). Addison-Wesley: Reading, MA, 1998; 248-379. Section 5.4: External Sorting.
12. Giegerich R, Kurtz S, Stoye J,. Efficient implementation of lazy suffix trees. Software-Practice and Experience 2003; 33 (11): 1035-1049.
13. Farach M, Muthukrishnan S,. Optimal logarithmic time randomized suffix tree construction. Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (Lecture Notes in Computer Science, vol. 1099). Springer: Berlin, 1996; 550-561.
14. Tian Y, Tata S, Hankins R, Patel J,. Practical methods for constructing suffix trees. The VLDB Journal 2005; 14 (3): 281-299.
15. Sadakane K,. Compressed suffix trees with full functionality. Theory of Computing Systems 2007; 41 (4): 589-607.
16. Fischer J, Mäkinen V, Navarro G,. An(other) entropy-bounded compressed suffix tree. Proceedings of the CPM-08 (Lecture Notes in Computer Science, vol. 5029). Springer: Berlin, 2008; 152-165.
17. Russo L, Navarro G, Oliveira A,. Dynamic fully-compressed suffix trees. Proceedings of the CPM'08 (Lecture Notes in Computer Science, vol. 5029). Springer: Berlin, 2008; 191-203.
18. Välimäki N, Gerlach W, Dixit K, Mäkinen V,. Engineering a compressed suffix tree implementation. Proceedings of the 6th Workshop on Experimental Algorithms (Lecture Notes in Computer Science, vol. 4525). Springer: Berlin, 2007; 217-228.
19. Välimäki N, Gerlach W, Dixit K, Mäkinen V,. Compressed suffix tree-A basis for genome-scale sequence analysis. Bioinformatics 2007; 23: 629-630.
20. Ukkonen E,. On-line construction of suffix trees. Algoritmica 1995; 14 (3): 249-260.
21. Giegerich R, Kurtz S,. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica 2012; 19 (3): 331-353.
22. Navarro G, Baeza-Yates R,. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms 2000; 1 (1): 205-209.
23. Bedathur SJ, Haritsa JR,. Engineering a fast online persistent suffix tree construction. Proceedings of the 20th International Conference on Data Engineering, Boston, U.S.A., 2004; 720.
24. Nelson M,. Fast String Searching With Suffix Trees. Available at: http://marknelson.us/1996/08/01/suffixtrees/ [February 2009].
25. Hunt E, Atkinson MP, Irving RW,. A database index to large biological sequences. The VLDB Journal 2001; 7 (3): 139-148.
26. Apostolico A, Szpankowski W,. Self-alignments in words and their applications. Journal of Algorithms 1992; 13 (3): 446-467.
27. Clifford R, Sergot MJ,. Distributed and paged suffix trees for large genetic databases. Proceedings of the CPM-2003, Morelia, Michocán, Mexico, 2003; 70-82.
28. Clifford R,. Distributed suffix trees. Journal of Discrete Algorithms 2005; 3 (2-4): 176-197.
29. Andersson A, Larsson NJ, Swanson K,. Suffix trees on words. Proceedings of the CPM-1996 (Lecture Notes in Computer Science, vol. 1075), 1996; 102-115.
30. Homo sapiens Chromosome 1 (36.3). Available at: http://www.ncbi.nlm.nih. gov/mapview/maps.cgi?taxid=9606chr=1 [February 2009].
31. Phoophakdee B, Zaki MJ,. Genome-scale disk-based suffix tree indexing. ACM SIGMOD International Conference on Management of Data, Beijing, China, 2007; 833-844.
32. Garcia-Molina H, Ullman JD, Widom JD,. Database System Implementation. Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1999; 43-48.
33. Barsky M, Stege U, Thomo A, Upton C,. A new method for indexing genomes using on-disk suffix trees. Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM, Napa Valley, CA, U.S.A., 2008; 649-658.
34. Larsson NJ, Sadakane K,. Faster suffix sorting. Technical Report LUCS-TR:99-214, Department of Computer Science, Lund University, Sweden, 1999.
35. Kurtz S, Phillippy A, Delcher A, Smoot M, Shumway M, Antonescu C, Salzberg S,. Versatile and open software for comparing large genomes. Genome Biology 2004; 5 (2): R12. Epub 30 January 2004.
36. Phoophakdee B, Zaki MJ,. Trellis+: An effective approach for indexing massive sequence. Pacific Symposium on Biocomputing, 2008.
37. Kurtz S, Schleiermacher C,. REPuter: Fast computation of maximal repeats in complete genomes. Bioinformatics 1999; 15: 426-427.
38. Farach-Colton M, Ferragina P, Muthukrishnan S,. On the sorting-complexity of suffix tree construction. Journal of the ACM 2000; 47 (6): 987-1011.
39. Kärkkäinen J, Sanders P,. Simple linear work suffix array construction. Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003; 943-955.
40. Kärkkäinen J, Sanders P, Burkhardt S,. Linear work suffix array construction. Journal of the ACM 2006; 53 (6): 918-936.
41. Dementiev R, Kärkkäinen J, Mehnert J, Sanders P,. Better external memory suffix array construction. Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, BC, Canada, 2005; 1-24.
42. Kasai T, Lee G, Arimura H, Arikawa S, Park K,. Linear-time longest-common-prefix computation in suffix arrays and its applications. Proceedings of the CPM-2001 (Lecture Notes in Computer Science, vol. 2089). Springer: Berlin, 2001; 181-192.
43. Manzini G,. Two Space Saving Tricks for Linear Time LCP Array Computation. Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (Lecture Notes in Computer Science, vol. 3111). Springer: Berlin, 2004; 372-383.
44. Chiang Y, Goodrich M, Grove E, Tamassia R, Vengroff D, Vitter J,. External-memory graph algorithms. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, U.S.A., 1995; 139-149.