Space Efficient Suffix Trees
- 1 May 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 39 (2) , 205-222
- https://doi.org/10.1006/jagm.2000.1151
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- A time and space efficient data structure for string searching on large textsInformation Processing Letters, 1996
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Space-efficient static trees and graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Sequence landscapesNucleic Acids Research, 1986
- Structural properties of the string statistics problemJournal of Computer and System Sciences, 1985
- Analyzing and compressing assembly codeACM SIGPLAN Notices, 1984
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975