Succinct Non-overlapping Indexing

DOI10.1007/978-3-319-19929-0_16zbMath1432.68089OpenAlexW775271723MaRDI QIDQ2942256

Rahul Shah, Arnab Ganguly, Sharma V. Thankachan

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_16

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05) Algorithms on strings (68W32)

Related Items (4)

Position-restricted substring searching over small alphabets ⋮ I/O-efficient data structures for non-overlapping indexing ⋮ Succinct non-overlapping indexing ⋮ Non-Overlapping Indexing - Cache Obliviously

Cites Work

• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• On-line construction of suffix trees
• On position restricted substring searching in succinct space
• Sorted Range Reporting
• Compressed representations of sequences and full-text indexes
• A fast string searching algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Position-Restricted Substring Searching
• Indexing compressed text
• Range Non-overlapping Indexing and Successive List Indexing
• Range Non-overlapping Indexing
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Alphabet-Independent Compressed Text Indexing
• Optimal static range reporting in one dimension

This page was built for publication: Succinct Non-overlapping Indexing