journal article
Jan 01, 2005
Constructing suffix tree for gigabyte sequences with megabyte memory
IEEE Transactions on Knowledge and Data Engineering
Vol. 17
No. 1
pp. 90-105
·
Institute of Electrical and Electronics Engineers (IEEE)
Topics
No keywords indexed for this article. Browse by subject →
References
26
[1]
Baeza-Yates "A Hybrid Indexing Method for Approximate String Matching" J. Discrete Algorithms (2000)
[3]
Bieganski "Genetic Sequence Data Retrieval and Manipulation Based on Generalized Suffix Trees" (1995)
[4]
Coffman (1997)
[5]
Cormen (1989)
[10]
[12]
[14]
[15]
Hunt "A Database Index to Large Biological Sequences"
[16]
Hunt "Persistent Suffix Trees and Suffix Binary Search Trees as DNA Sequence" (2000)
[23]
[24]
[25]
[26]
Metrics
48
Citations
26
References
Details
- Published
- Jan 01, 2005
- Vol/Issue
- 17(1)
- Pages
- 90-105
- License
- View
Cite This Article
Ching-Fung Cheung, Jeffrey Xu Yu, Hongjun Lu (2005). Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering, 17(1), 90-105. https://doi.org/10.1109/tkde.2005.3
Related
You May Also Like
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
G. Adomavicius, A. Tuzhilin · 2005
7,269 citations
Knowledge Graph Embedding: A Survey of Approaches and Applications
Quan Wang, Zhendong Mao · 2017
1,991 citations