Now, we come to offer you the right catalogues of book to open. flexible pattern matching in strings practical on line search algorithms for texts and biological sequences is one of the literary work… (More)
We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m +1 states and… (More)
The most important features of a string matching algorithm are its efficiency and its flexibility. Efficiency has traditionally received more attention, while flexibility in the search pattern is… (More)
We address in this paper the problem of string matching on Lempel-Ziv compressed text. The goal is to search a pattern in a text without uncompressing. This is a highly relevant issue, since it is… (More)
The problem of fast exact and approximate searching for a pattern that contains classes of characters and bounded size gaps (CBG) in a text has a wide range of applications, among which a very… (More)
Let t be a permutation (that shall play the role of the text) on [n] and a pattern p be a sequence of m distinct integer(s) of [n], m ≤ n. The pattern p occurs in t in position i if and only if p1 .… (More)
We introduce a new approach to compute the common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient… (More)