Optimal prefix and suffix queries on texts

DOI10.1016/J.IPL.2008.05.027MaRDI QIDQ975480zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

algorithmsdata structurespattern matchingcombinatorial problems

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Optimal prefix and suffix queries on texts
• Position-restricted substring searching over small alphabets
• On position restricted substring searching in succinct space
• Position-Restricted Substring Searching
• Efficient indexes for the positional pattern matching problem and two related problems over small alphabets

Cites work

• scientific article; zbMATH DE number 1615292 (Why is no real title available?)
• scientific article; zbMATH DE number 1003303 (Why is no real title available?)
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 2119724 (Why is no real title available?)
• scientific article; zbMATH DE number 910911 (Why is no real title available?)
• scientific article; zbMATH DE number 6146456 (Why is no real title available?)
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• A Space-Economical Suffix Tree Construction Algorithm
• A greedy approximation algorithm for constructing shortest common superstrings
• A linear-time algorithm for finding approximate shortest common superstrings
• Algorithms on Strings, Trees and Sequences
• An efficient algorithm for the all pairs suffix-prefix problem
• Combinatorial Pattern Matching
• Combinatorial Pattern Matching
• Combinatorial algorithms for DNA sequence assembly
• Compressed representations of sequences and full-text indexes
• Dictionary matching and indexing with errors and don't cares
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes
• Fast Pattern Matching in Strings
• Faster index for property matching
• Finding Patterns in Given Intervals
• Finding Patterns with Variable Length Gaps or Don’t Cares
• Indexing Circular Patterns
• Indexing Factors with Gaps
• Jewels of Stringology
• On-line construction of suffix trees
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• Position-Restricted Substring Searching
• Succinct data structures for flexible text retrieval systems
• Text Indexing and Dictionary Matching with One Error

Cited in

(5)

• Substring range reporting
• scientific article; zbMATH DE number 6850405 (Why is no real title available?)
• Optimal prefix and suffix queries on texts
• All-pairs suffix/prefix in optimal time using Aho-Corasick space
• Substring Range Reporting

This page was built for publication: Optimal prefix and suffix queries on texts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975480)