Fast circular dictionary-matching algorithm

DOI10.1017/S0960129515000134zbMath1362.68299OpenAlexW2171866929MaRDI QIDQ2971059

Widmer Bland, Chang Liu, Solon P. Pissis, Jia Gao, Costas S. Iliopoulos, Carl Barton, Tanver Athar

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000134

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Parameterized dictionary matching and recognition with one gap ⋮ Searching and Indexing Circular Patterns ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet

Cites Work

• Unnamed Item
• The longest common extension problem revisited and applications to approximate string searching
• Approximate string matching using compressed suffix arrays
• Construction of Aho Corasick automaton in linear time for integer alphabets
• Average-optimal string matching
• Faster compressed dictionary matching
• Average-Case Optimal Approximate Circular String Matching
• Compressed indexes for dynamic text collections
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Succinct Indexes for Circular Patterns
• Suffix Arrays: A New Method for On-Line String Searches
• Succinct Dictionary Matching with No Slowdown
• Efficient string matching
• Partial-Match Retrieval Algorithms
• Algorithms on Strings, Trees and Sequences
• Space-Efficient Construction Algorithm for the Circular Suffix Tree
• Inducing the LCP-Array
• Indexing Circular Patterns

This page was built for publication: Fast circular dictionary-matching algorithm