and Wojciech Rytter. Finding Motifs with Gaps. Unpublished manuscript (0)

by Maxime Crochemore, Costas S Iliopoulos, Yoan J Pinzon
Results 1 - 2 of 2

Approximate String Matching with Gaps

by Maxime Crochemore, Christos Makris, Wojciech Rytter, Athanasios Tsakalidis, Kostas Tsichlas , 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 9 (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.

unknown title

by Costas Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios Tsakalidis, Kostas Tsichlas
"... k Abstract 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 devised for each version and their time and space complexities are s ..."
Abstract - Add to MetaCart
k Abstract 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 devised for each version and their time and space complexities are stated. These specific versions of approximate string matching have various applications in computerized music analysis.