Fast parameterized matching with \(q\)-grams

DOI10.1016/j.jda.2007.11.001zbMath1160.68483OpenAlexW2041741600MaRDI QIDQ1018090

Leena Salmela, Jorma Tarhio

Publication date: 13 May 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.11.001

zbMATH Keywords

string matchingparameterized matching2-dimensional string matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics on words (68R15) Pattern recognition, speech recognition (68T10)

Related Items

Weighted approximate parameterized string matching ⋮ Compressed parameterized pattern matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple matching of parameterized patterns
• Efficient parameterized string matching
• Alphabet dependence in parameterized matching
• Speeding up two string-matching algorithms
• A fast string searching algorithm
• Faster suffix tree construction with missing suffix links
• Multipattern string matching with q -grams
• Approximate Boyer–Moore String Matching
• Fast Pattern Matching in Strings
• A theory of parameterized pattern matching
• Algorithms – ESA 2004
• Combinatorial Pattern Matching