EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING

DOI10.1142/S0129054108005607zbMath1169.68651OpenAlexW1974189607MaRDI QIDQ3532148

Kimmo Fredriksson, Szymon Grabowski

Publication date: 3 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005607

zbMATH Keywords

approximate string matchingcomputational biologybounded gapssparse dynamic programmingmusic information retrieval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10) Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (2)

Order-preserving matching ⋮ On approximate pattern matching with thresholds

Cites Work

• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• A priority queue in which initialization and queue operations takeO(loglogD) time
• Universal codeword sets and representations of the integers
• Transposition invariant string matching

This page was built for publication: EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING