scientific article; zbMATH DE number 2087053
From MaRDI portal
Publication:4737699
zbMATH Open1077.68823MaRDI QIDQ4737699FDOQ4737699
Authors: Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2373/23730178.htm
Title of this publication is not available (Why is that?)
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 \((\delta , \alpha )\)-matching problem with applications in music information retrieval
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)
Cited In (11)
- Order-preserving pattern matching indeterminate strings
- Order-preserving pattern matching indeterminate strings
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- On special families of morphisms related to \(\delta \)-matching and don't care symbols
- Algorithms on Extended (δ, γ)-Matching
- A bit-parallel suffix automaton approach for \((\delta,\gamma)\)-matching in music retrieval.
- EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
- Experimental and Efficient Algorithms
- Order-preserving matching
- Title not available (Why is that?)
- Combinatorial Pattern Matching
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 Q4737699)