Efficient Bit-Parallel Algorithms for (δ,α)-Matching

DOI10.1007/11764298_15MaRDI QIDQ5307542zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Szymon Grabowski

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_15

zbMATH Keywords

approximate string matchingbit-parallelismmusic information retrievalnondeterministic finite automataprotein matching

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING
• New efficient bit-parallel algorithms for the ( , )-matching problem with applications in music information retrieval
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• scientific article; zbMATH DE number 2087055
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata

Cited in

(10)

• A new pairwise NPN Boolean matching algorithm based on structural difference signature
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Simple algorithm for pattern-matching with bounded gaps in genomic sequences
• EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING
• Nested Counters in Bit-Parallel String Matching
• New efficient bit-parallel algorithms for the ( , )-matching problem with applications in music information retrieval
• Motif matching using gapped patterns
• Combinatorial Pattern Matching

This page was built for publication: Efficient Bit-Parallel Algorithms for (δ,α)-Matching

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