Indexing Highly Repetitive Collections

DOI10.1007/978-3-642-35926-2_29zbMath1293.68087OpenAlexW2233676531MaRDI QIDQ2876586

Gonzalo Navarro

Publication date: 19 August 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35926-2_29

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)

Related Items (19)

FM-index of alignment: a compressed index for similar strings ⋮ Access, Rank, and Select in Grammar-compressed Strings ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Grammar compressed sequences with rank/select support ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Adaptive learning of compressible strings ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ String Indexing with Compressed Patterns ⋮ String Attractors for Factors of the Thue-Morse Word ⋮ Time-space trade-offs for Lempel-Ziv compressed indexing ⋮ Random access in persistent strings and segment selection ⋮ FM-index of alignment with gaps ⋮ Lempel-Ziv-like parsing in small space ⋮ Unnamed Item ⋮ Pattern Matching on Elastic-Degenerate Text with Errors ⋮ Unnamed Item ⋮ Approximate pattern matching on elastic-degenerate text ⋮ Lazy Lempel-Ziv Factorization Algorithms ⋮ Faster Compressed Suffix Trees for Repetitive Collections

This page was built for publication: Indexing Highly Repetitive Collections