An Opportunistic Text Indexing Structure Based on Run Length Encoding

DOI10.1007/978-3-319-18173-8_29zbMATH Open1459.68045OpenAlexW2256958449MaRDI QIDQ2947038

Yuya Tamakoshi, Shunsuke Inenaga, Hideo Bannai, Keisuke Goto, Masayuki Takeda

Publication date: 21 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_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)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized searching with mismatches for run-length encoded strings
• Dynamic rank/select structures with applications to run-length encoded texts
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Optimal lower bounds for rank and select indexes
• Space efficient linear time construction of suffix arrays
• Wavelet Trees for All
• Faster Compact On-Line Lempel-Ziv Factorization
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Suffix Arrays: A New Method for On-Line String Searches
• A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
• A universal algorithm for sequential data compression
• Two Efficient Algorithms for Linear Time Suffix Array Construction
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Related Items (1)

Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts

Recommendations

• Dynamic rank/select structures with applications to run-length encoded texts 👍 👎
• Indexing text using the Ziv--Lempel trie 👍 👎
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing 👍 👎
• Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts 👍 👎
• Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings 👍 👎
• Optimal Construction of Compressed Indexes for Highly Repetitive Texts 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: An Opportunistic Text Indexing Structure Based on Run Length Encoding