See this document in CiteSeerX!

Approximate String Matching in Musical Sequences (2001)  (Make Corrections)  (7 citations)
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzon



  Home/Search   Context   Related

 
View or download:
igm.univmlv.fr/~mac/REC/DO...01PSC.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  igm.univmlv.fr/~m...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Here we consider computational problems on -approximate and (; )-approximate string matching. These are two new notions of approximate matching that arise naturally in applications of computer assisted music analysis. We present fast, efficient and practical algorithms for these two notions of approximate string matching. (Update)

Similar documents based on text:   More   All
2.4:   Algorithms for Computing Approximate Repetitions.. - Cambouropoulos.. (1999)   (Correct)
2.3:   Computing Approximate Repetitions in Musical Sequences - Iliopoulos, Lecroq.. (2000)   (Correct)
2.0:   Fast Evolutionary Chains - Crochemore, Iliopoulos, Pinzon   (Correct)

BibTeX entry:   (Update)

M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzn. Approximate string matching in musical sequences. In Proc. PSC 2001, pp. 2636, 2001. http://citeseer.ist.psu.edu/article/crochemore01approximate.html   More

@misc{ crochemore01approximate,
  author = "M. Crochemore and C. Iliopoulos and T. Lecroq and Y. Pinzn",
  title = "Approximate string matching in musical sequences",
  text = "M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzn. Approximate
    string matching in musical sequences. In Proc. PSC 2001, pp. 2636, 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/article/crochemore01approximate.html" }
Citations (may not include all citations):
214   A fast string searching algorithm (context) - Boyer, Moore - 1977
196   Fast text searching allowing errors (context) - Wu, Manber - 1992
56   A very fast substring search algorithm (context) - Sunday - 1990
39   String Matching Techniques for Musical Similarity and Melodi.. (context) - Crawford, Iliopoulos et al. - 1998
29   Ecient string matching: an aid to bibliographic search (context) - Aho, Corasick - 1975
28   Discovering simple DNA sequences by the algorithmic signican.. (context) - Milosavljevic, Jurka - 1993
22   Algorithms for computing approximate repetitions in musical .. - Cambouropoulos, Crochemore et al. - 1999
21   Reconstructing strings from substrings - Skiena, Sundaram - 1995
20   algorithm for nding all repetitions in a string (context) - Main, Lorentz et al. - 1984
19   Musical Pattern Extraction and Similarity Assessment (context) - Rolland, Ganascia - 1999
12   MIDIMatch: Musical Pattern Matching in Real Time (context) - McGettrick - 1997
9   All shortest paths in weighted grid graphs and its applicati.. - Schmidt - 1998
9   Gray Code Masks for DNA Sequencing by Hybridization (context) - Pevzner, Feldman - 1993
8   Ecients algorithms for molecular sequences analysis (context) - Karlin, Morris et al. - 1988
6   A very fast string matching algorithm for small alphabets an.. - Charras, Lecroq et al. - 1998

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://igm.univ-mlv.fr/~mac/REC/publications.html):   More
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms - Crochemore, Iliopoulos (2001)   (Correct)
Reducing Space for Index Implementation - Crochemore   (Correct)
A Sub-quadratic Sequence Alignment Algorithm for.. - Crochemore, Landau.. (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC