Three heuristics for -matching: -BM algorithms

DOI10.1007/3-540-45452-7_16MaRDI QIDQ4737699zbMATH OpenFDO

Authors Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730178.htm

zbMATH Keywords

pattern matchingprocessing of large musical data

Mathematics Subject Classification ID

Combinatorics on words (68R15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1998335
• A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval.
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• Experimental and Efficient Algorithms
• New efficient bit-parallel algorithms for the ( , )-matching problem with applications in music information retrieval

Cited in

(11)

• On special families of morphisms related to \(\delta \)-matching and don't care symbols
• Order-preserving pattern matching indeterminate strings
• Order-preserving matching
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING
• Algorithms on Extended (δ, γ)-Matching
• scientific article; zbMATH DE number 1998335 (Why is no real title available?)
• Order-preserving pattern matching indeterminate strings
• Experimental and Efficient Algorithms
• Combinatorial Pattern Matching
• A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval.

This page was built for publication: Three heuristics for \(\delta\)-matching: \(\delta\)-BM algorithms

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