Optimal prefix and suffix queries on texts
From MaRDI portal
Publication:975480
DOI10.1016/j.ipl.2008.05.027zbMath1191.68205OpenAlexW1975060495WikidataQ61677924 ScholiaQ61677924MaRDI QIDQ975480
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.027
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for finding approximate shortest common superstrings
- Succinct data structures for flexible text retrieval systems
- A greedy approximation algorithm for constructing shortest common superstrings
- An efficient algorithm for the all pairs suffix-prefix problem
- On-line construction of suffix trees
- Combinatorial algorithms for DNA sequence assembly
- Faster index for property matching
- Compressed representations of sequences and full-text indexes
- Finding Patterns in Given Intervals
- Position-Restricted Substring Searching
- Dictionary matching and indexing with errors and don't cares
- Finding Patterns with Variable Length Gaps or Don’t Cares
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Algorithms on Strings, Trees and Sequences
- Jewels of Stringology
- Text Indexing and Dictionary Matching with One Error
- Parallel Suffix–Prefix-Matching Algorithm and Applications
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes
- Combinatorial Pattern Matching
- Indexing Factors with Gaps
- Indexing Circular Patterns
- Combinatorial Pattern Matching
This page was built for publication: Optimal prefix and suffix queries on texts
