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

DOI10.1142/S0129054108005607zbMATH Open1169.68651OpenAlexW1974189607MaRDI QIDQ3532148FDOQ3532148

Authors: 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

Recommendations

• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• Combinatorial Pattern Matching
• Algorithms on Extended (δ, γ)-Matching
• scientific article; zbMATH DE number 2087053
• Faster algorithms for string matching with k mismatches

zbMATH Keywords

computational biologybounded gapssparse dynamic programmingapproximate string matchingmusic information retrieval

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• Algorithms on Extended (δ, γ)-Matching
• Order-preserving matching
• Simple algorithm for pattern-matching with bounded gaps in genomic sequences
• Combinatorial Pattern Matching
• On approximate pattern matching with thresholds

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

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