scientific article; zbMATH DE number 1998335

MaRDI QIDQ4432970zbMATH OpenFDO

Authors Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan Pinzón, Wojciech Plandowski, Wojciech Rytter

Publication date 15 December 2003

zbMATH Keywords

approximate string matchingcomputer-assisted music analysisdynamic programmingstring algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

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

Cited in

(10)

• On special families of morphisms related to \(\delta \)-matching and don't care symbols
• Heuristic approaches to the distinguishing substring selection problem
• A brief history of parameterized matching problems
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• scientific article; zbMATH DE number 1809602 (Why is no real title available?)
• New efficient bit-parallel algorithms for the ( , )-matching problem with applications in music information retrieval
• scientific article; zbMATH DE number 2087053 (Why is no real title available?)
• On approximate pattern matching with thresholds
• Experimental and Efficient Algorithms
• A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval.

This page was built for publication:

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