Results 1 
2 of
2
Approximate String Matching with Gaps
, 2002
"... In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are sketched for each version and their time and space complexity is stated. The sp ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are sketched for each version and their time and space complexity is stated. The specific versions of approximate string matching have various applications in computerized music analysis.
Evolution of Musical Motifs in Polyphonic Passages
 Symposium on AI and Creativity in Arts and Science, Proceedings of AISB’02
, 2002
"... In this paper we consider the problem of motif evolution in polyphonic musical sequences. A related problem, where a set of sequences of notes (one sequence for a voice) and a pattern is given, is to find whether approximate occurrences of the pattern occur distributed across the sequences (Holub ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper we consider the problem of motif evolution in polyphonic musical sequences. A related problem, where a set of sequences of notes (one sequence for a voice) and a pattern is given, is to find whether approximate occurrences of the pattern occur distributed across the sequences (Holub et al., 1999; Lemstrom and Tarhio, 2000). Formally, this related problem is as follows: given a set t of h strings (each representing a voice) t 1 ; : : : ; t n ; i 2 f1::hg, for some constant h and a pattern p = p1 ; : : : ; pm , we say that p occurs at position j of t if p1 = t j ; p2 = t j+1 ; : : : ; pm = t j+m 1 for some fi1 ; : : : ; i mg 2 f1::hg. Our problem of finding evolutionary chains is defined as follows: given a set t of h strings t (the target), for some constant h and a motif p, find whether there exists a sequence u1 = p; u2 ; : : : ; u ` occurring in the target t such that u j+1 occurs to the right of u j in t and for any given j 2 f1::` 1g, u j and u j+1 are similar enough, i.e., they do not differ more than by a certain number of basic operations  insertions, deletions and substitutions. In this paper, we consider several variants of the evolutionary chain problem and present efficient algorithms solving them.