LZ77-Based Self-indexing with Faster Pattern Matching

DOI10.1007/978-3-642-54423-1_63zbMath1405.68104OpenAlexW226134553MaRDI QIDQ5405087

Yakov Nekrich, Travis Gagie, Paweł Gawrychowski, Simon J. Puglisi, Juha Kärkkäinen

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_63

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Information storage and retrieval of data (68P20)

Related Items (21)

Comparison of LZ77-type parsings ⋮ Arithmetics on Suffix Arrays of Fibonacci Words ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Unnamed Item ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ Grammar compressed sequences with rank/select support ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Composite Repetition-Aware Data Structures ⋮ String Indexing with Compressed Patterns ⋮ Time-space trade-offs for Lempel-Ziv compressed indexing ⋮ Random access in persistent strings and segment selection ⋮ Unnamed Item ⋮ Universal compressed text indexing ⋮ siEDM: an efficient string index and search algorithm for edit distance with moves ⋮ A Self-index on Block Trees ⋮ Flexible indexing of repetitive collections ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Dynamic index and LZ factorization in compressed space ⋮ Top tree compression of tries ⋮ Finger search in grammar-compressed strings ⋮ LZ-End Parsing in Linear Time

This page was built for publication: LZ77-Based Self-indexing with Faster Pattern Matching