In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gaps and a text T our… (More)

Here we consider string matching problems that arise naturally in applications to music retrieval. The δ-Matching problem calculates, for a given text T1..n and a pattern P1..m on an alphabet of… (More)

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation… (More)

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation… (More)

The deviation of the observed frequency of a word w from its expected frequency in a given sequence x is used to determine whether or not the word is avoided. This concept is particularly useful in… (More)

We consider the problem of determining the minimum cardinality collection of substrings, each of given length k ≥ 2, that “cover” a given string x of length n. We show first, by reduction from 3-SAT,… (More)

A degenerate symbol x̃ over an alphabet Σ is a non-empty subset of Σ, and a sequence of such symbols is a degenerate string. A degenerate string is said to be conservative if its number of non-solid… (More)

DNA sequencing is the process of determining the exact order of the nucleotide bases of an individual’s genome in order to catalogue sequence variation and understand its biological consequences.… (More)