Engineering a fast online persistent suffix tree construction

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 720-731

  Bedathur, Srikanta J ^a   Haritsa, Jayant R ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT-OUTPUT COSTS; SUFFIX TREE CONSTRUCTION;

ALGORITHMS; ARRAYS; DATABASE SYSTEMS; DNA; GENETIC ENGINEERING; INPUT OUTPUT PROGRAMS; PROTEINS; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 2442535875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1320040     Document Type: Conference Paper

References (23)

1. P. Bieganski. Genetic sequence data retrieval and manipulation based on generalized suffix trees. Ph. D. Thesis, University of Minnesota, 1995.
2. H. Chou and D. Dewitt. An evaluation of buffer management strategies for relational database systems. In Proc. of 11th VLDB Conf., 1985.
3. E. Hunt. PJama Stores and Suffix Tree Indexing for Bioinformatics Applications. In Proc. of ECOOP, 2000.
4. E. Hunt, M. P. Atkinson, and R. W. Irving. A Database Index to Large Biological Sequences. In Proc. of the 27th VLDB Conference, 2001.
5. E. J. O'Neil, P. E. O'Neil, and G. Weikum. The lru-k page replacement algorithm for database disk buffering. In Proc. of the ACM SIGMOD Intl. Conf. on Mgmt. of Data, 1993.
6. E. M. McCreight. A Space-Efficient Suffix Tree Construction Algorithm. JACM, 23(2), 1976.
7. E. Ukkonen. Online Construction of Suffix-trees. Algorithmica, 14, 1995.
8. G. Navarro and R. Baeza-Yates. A Hybrid Indexing Method for Approximate String Matching. Jl. of Discrete Algorithms, 2000.
9. Giovanni Maria Sacco. Index Access with Finite Buffer. In Proc. of 13th VLDB Conf., 1987.
10. D. Gusfield. Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge, 1997.
11. D. Gusfield. Suffix trees come of age in bioinformatics (invited talk). In IEEE Bioinformatics Conference (CSB), 2002.
12. T. Johnson and D. Shasha. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In Proc. of the 20th VLDB Conf., 1994.
13. M. Farach, P. Ferragina, and S. Muthukrishnan. Overcoming the Memory Bottleneck in Suffix Tree Construction. Proc. of IEEE Annual Symposium on Foundations of Computer Science, 1998.
14. M. Farach-Colton. Optimal Suffix Tree Construction with Large Alphabets. In Proc. of IEEE Annual Symposium on Foundations of Computer Science, 1997.
15. GenBank Overview. http://www.ncbi.nlm.nih.gov/Genbank/GenbankOverview. html, 2002.
16. P. Weiner. Linear Pattern Matching algorithms. In Proc. of the 14th IEEE Symp. on Switching and Automata Theory, 1973.
17. R. Giegerich and S. Kurtz. A Comparison of Imperative and purely Functional Suffix tree constructions. Science of Programming, 1995.
18. R. Japp. First Year Report. Master's thesis, University of Glasgow, July 2001.
19. S. Kurtz. Reducing Space Requirement of Suffix Trees. Software Practice and Experience, 29(13):1149-1171, 1999.
20. Swiss-prot protein knowledgebase. http://www.expasy.org/sprot/, 2002.
21. W. Effelsberg and T. Haerder. Principles of Database Buffer Management. ACM Transactions on Database Systems, 9(4), 1984.
22. W. I. Chang and E. L. Lawler. Approximate string matching in sublinear expected time. In Proc. of IEEE Annual Symposium on Foundations of Computer Science, 1990.
23. W. Szpankowski. Average Case Analysis of Algorithms on Sequences. Wiley-Interscience, 2001.