Crochemore M., Iliopoulos C. S. , Lecroq T., and Pinzon Y. J.: Approximate string matching in musical sequences. In M. Balik and M. Simanek, editors, Proceedings of Prague Stringology Club Workshop (PSCW'01), pages 26-36, Czech Technical University, Prague, Czech Republic, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
....in evaluating the edit distance measures. The summary of our results is given in Section 3. The full version of this paper appears as a technical report [21] There we also study easier (non gapped) measures of similarity under transposition invariance (like Hamming distance and ( matching [5, 19]) that have other applications besides MIR. Supported by the Academy of Finland under grant 22584. Supported by Millenium Nucleus Center for Web Research, Grant P01 029 F, Mideplan, Chile. 2 De nitions Let be a nite numerical alphabet, which is a subset of some universe U that is ....
M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzn. Approximate string matching in musical sequences. In Proc. PSC 2001, pp. 2636, 2001.
Three Heuristics for δ-Matching: δ-BM.. - Crochemore.. (2002) Self-citation (Crochemore Iliopoulos Lecroq) (Correct)
No context found.
M. Crochemore, C.S. Iliopoulos, T. Lecroq and Y.J. Pinzon, Approximate string matching in musical sequences, In M. Bal ik and M. Simanek, editors, Proceedings of the Prague Stringology Conference'01, Prague, Tcheque Republic, 2001, Annual Report DC{2001-06, 26-36.
On Special Families of Morphisms Related to.. - Cole, Iliopoulos, al. (2002) Self-citation (Iliopoulos Lecroq) (Correct)
....motivated by applications in musical information retrieval, where the alphabet is an interval of integers (see [1,7] A match of a pattern P of length m in a text T is a position j in T such jP [i j 1] T [j] for 1 i m. Algorithms for solving this problem have been presented in [2,4,3]. We investigate relations between matching and pattern matching with don t care symbol (a symbol matching every symbol, including itself) We show a close correspondence between pattern matching with don t cares and matching. The matching is reducible to k instances of pattern matching with ....
M. Crochemore, C.S. Iliopoulos, T. Lecroq and Y.J. Pinzon, Approximate string matching in musical sequences in: M. Balk and M. Simanek, eds., Proceedings of the Prague Stringology Conference (Prague, Tcheque Republic, 2001) Annual Report DC-2001-06, 26-39.
New Upper Bounds on Various String Manipulation Problems - Makris, Panagis.. (Correct)
No context found.
Crochemore M., Iliopoulos C. S. , Lecroq T., and Pinzon Y. J.: Approximate string matching in musical sequences. In M. Balik and M. Simanek, editors, Proceedings of Prague Stringology Club Workshop (PSCW'01), pages 26-36, Czech Technical University, Prague, Czech Republic, 2001.
Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2004) (Correct)
No context found.
M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzon. Approximate string matching in musical sequences. In Proc. Prague Stringology Club (PSC 2001.
Matching Numeric Strings under Noise - Mäkinen, Navarro, Ukkonen (Correct)
No context found.
M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzn. Approximate string matching in musical sequences. In Proc. Prague Stringoly Club (PSC 2001), M. Baliik and M. Simanek, eds, Czech Technical University of Prague, pp. 2636, DC-2001-06, 2001.
Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
No context found.
M. Crochemore, C.S. Iliopoulos, T. Lecroq, and Y.J. Pinzn. Approximate string matching in musical sequences. In Proc. Prague Stringology Club (PSC 2001.
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