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

DOI10.1007/11764298_15zbMath1196.68349OpenAlexW1488240536MaRDI QIDQ5307542

Szymon Grabowski, Kimmo Fredriksson

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 matchingnondeterministic finite automatabit-parallelismmusic information retrievalprotein matching

Mathematics Subject Classification ID

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

Related Items (2)

Motif matching using gapped patterns ⋮ Nested Counters in Bit-Parallel String Matching

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