On minimizing pattern splitting in multi-track string matching

Aho, 1975, Efficient string matching, Comm. ACM, 18, 333, 10.1145/360825.360855 Cole, 2002, Verifying candidate matches in sparse and wildcard matching, 592 Crawford, 1998, String matching techniques for musical similarity and melodic recognition, Computing in Musicology, 11, 71 Crochemore, 1988, String matching with constraints, 44 Crochemore, 2002, Approximate string matching with gaps, Nordic J. Comput., 9, 54 Gajewska, 1986, Deques with heap order, Inform. Process. Lett., 12, 197, 10.1016/0020-0190(86)90028-1 Galil, 1990, An improved algorithm for approximate string matching, SIAM J. Comput., 19, 989, 10.1137/0219067 Iliopoulos, 2002, String matching with gaps for musical melodic recognition, 55 Landau, 1988, Fast string matching with k differences, J. Comput. Syst., 37, 63, 10.1016/0022-0000(88)90045-1 Lemström, 2003, On finding minimum splitting of pattern in multi-track string matching, vol. 2676, 237 Lemström, 2003, Transposition invariant pattern matching for multi-track strings, Nordic J. Comput., 10, 185 V. Mäkinen, Parameterized approximate string matching and local-similarity-based point-pattern matching, PhD Thesis, Report A-2003-6, Department of Computer Science, Univ. of Helsinki, August 2003 Mäkinen, 2003, Algorithms for transposition invariant string matching, vol. 2607, 191 Meredith, 2001, Pattern induction and matching in polyphonic music and other multi-dimensional datasets, 61 Manber, 1990, Suffix arrays: a new method for on-line string searches, 319 Ukkonen, 2003, Sweepline the music!, vol. 2598, 330 Ukkonen, 1993, Fast approximate string matching with suffix automata, Algorithmica, 10, 353, 10.1007/BF01769703