Indexing Text Using the Ziv-Lempel Trie
- 18 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 325-336
- https://doi.org/10.1007/3-540-45735-6_28
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Opportunistic data structures with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Compact Suffix ArrayLecture Notes in Computer Science, 2000
- Compression of Low Entropy Strings with Lempel--Ziv AlgorithmsSIAM Journal on Computing, 2000
- TablesLecture Notes in Computer Science, 1996
- Suffix cactus: A cross between suffix tree and suffix arrayLecture Notes in Computer Science, 1995
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Space-efficient static trees and graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A Functional Approach to Data Structures and Its Use in Multidimensional SearchingSIAM Journal on Computing, 1988
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985