Practical Suffix Tree Construction

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 36-47

  Tata, Sandeep ^a   Hankins, Richard A ^a   Patel, Jignesh M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 25844486159     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50007-3     Document Type: Chapter

References (34)

1. A. Andersson and S. Nilsson (1995) Efficient Implementation of Suffix Trees. Software-Practice and Experience (SPE) 25(2), 129-141.
2. R. Apweiler, A. Bairoch, C.H. Wu, W. Barker, B. Boeckmann, S. Ferro, E. Gasteiger, H. Huang, R. Lopez, M. Magrane, M. Martin M.j., D. Natale, A.C. O'Donovan, N. Redaschi and L.L. Yeh (2004) UniProt: the Universal Protein Knowledgebase. Nucleic Acids Research 32(D), 115-119.
3. M. Atkinson and M. Jordan (1998) Providing Orthogonal Persistence for Jave. European Conference on Object-Oriented Programming (ECOO)
4. S.J. Bedathur and J.R. Haritsa (2004) Engineering a Fast Online Persistent Suffix Tree, Construction. ICDE
5. A. blumer, A. Ehrenfeucht and D. Haussler (1989) Average Sizes of Suffix Trees and DAWGs. Discrete Applied Mathematics 24(1), 37-45.
6. A. Carvalho, A. Freitas, A. Oliveira and M.-F. Sagot (2004) A Parallel Algorithm for the Extraction of Structured Motifs. ACM Symposium on Applied Computing
7. S. Chen, A. Ailamaki, P. Gibbons and T. Mowry (2004) Improving Hash Join Performance through Prefetching. ICDE
8. L.-L. Cheng, D. Cheung and S.-M. Yiu (2003) Approximate String Matching in DNA Sequences. Proceedings of the Eighth International Conference on Database Systems for Advanced Applications 303-310.
9. A. Crauser and P. Ferragina (2002) A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory and its Applications. Algorithmica 32(1), 1-35.
10. A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White and S. Salzberg (1999) Alignment of Whole Genomes. Nucleic Acids Research 27(11), 2369-2376.
11. A. Delcher, A. Phillippy, J. Carlton and S. Salzberg (2002) Fast Algorithms for Large-scale Genome Alignment and Comparision. Nucleic Acids Research 30(11), 2478-2483.
12. M. Farach-Colton, P. Ferragina and S. Muthukrishnan (2000) On the Sorting-complexity of Suffix tree Construction. J. ACM 47(6), 987-1011.
13. GenBank (2004) NCBI http://www.ncbi.nlm.nih.gov/GenBank
14. R. Giegerich and S Kurtz (1997) From Ukkonen to McCreight and Weiner: A Unifying View of Linear-time Suffix Tree Construction. Algorithmica 19(3), 331-353.
15. R. Giegerich, S. Kurtz and J. Stoye (1999) Efficient Implementation of Lazy Suffix Trees. Proceedings of the Third Workshop on Algorithm Engineering (WAE'99)
16. D. Gusfield (1990) An “Increment-by-one” Approach to Suffix Arrays and Trees. Technical Report CSE-90-39 Davis: Computer Science Division, University of California
17. D. Gusfield (1997) Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Cambridge University Press
18. E. Hunt, M.P. Atkinson and R.W. Irving (2001) A Database Index to Large Biological Sequences. The VLDB J. 7(3), 139-148.
19. Intel Corporation (2004) The IA-32 Intel Architecture Optimization Reference Manual Intel (Order Number 248966)
20. Intel Corporation (2004) The IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide Intel (Order Number 253668)
21. S. Kurtz (1999) Reducing Space Requirement of Suffix Trees. Software Practice and Experience 29(13), 1149-1171.
22. S. Kurtz, A. Phillippy, A. Delcher, M. Smoot, M. Shumway, C. Antonescu and S. Salzberg (2004) Versatile and Open Software for Comparing Large Genomes. Genome Biology 5(R12)
23. S. Kurtz and C. Schleiermacher (1999) REPuter: Fast Computation of Maximal Repeats in Complete Genomes. Bioinformatics 15(5), 426-427.
24. E.M. McCreight (1976) A Space-economical Suffix Tree Construction Algorithm. J. ACM. 23(2), 262-272.
25. C. Meek, J.M. Patel and S. Kasetty (2003) OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences. VLDB
26. G. Navarro, R. Baeza-Yates and J. Tariho (2001) Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin 24(4), 19-27.
27. J.M. Patel (2003) The Role of Declarative Querying in Bioinformatics. OMICS 7(1), 89-92.
28. M. Pettersson. Perfctr: Linux Performance Montioring Counters Driver http://user.it.uu.se/~mikpe/linux/perfctr
29. Project Gutenberg http://www.gutenberg.net
30. W. Szpankowski (2001) Average-Case Analysis of Algorithms on Sequences John Wiley and Sons
31. The Growth of GenBank NCBI http://www.ncbi.nlm.nih.gov/genbank/genbankstats.html
32. E. Ukkonen (1992) Constructing Suffix-trees On-Line in Linear Time. Algorithms, Software, Architecture: Information Processing 1(92), 484-492.
33. P. Weiner (1973) Linear Pattern Matching Algorithms. Proceedings of the 14th Annual Symposium on Switching and Automata Theory
34. S. Yona and D. Tsadok. ANSI C. Implementation of a Suffix Tree cs.haifa.ac.il/~shlomo/suffix_tree