Results 1  10
of
64
On the Suffix Automaton with mismatches
, 2007
"... In this paper we focus on the construction of the minimal deterministic finite automaton S k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of the automaton S k in order to accept in an efficient way the language of all suffixes of w up to k e ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we focus on the construction of the minimal deterministic finite automaton S k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of the automaton S k in order to accept in an efficient way the language of all suffixes of w up to k
From nondeterministic suffix automaton to lazy suffix tree
"... Given two strings, a pattern P of length m and a text T of length n over some alphabet Σ of size σ, we consider the exact string matching problem, i.e. we want to report all occurrences of P in T. The wellknown BackwardNondeterministicDAWGMatching (BNDM) algorithm is one of the most efficient ..."
Abstract
 Add to MetaCart
algorithm for short to moderate length patterns. In this paper – as a prelude – we take the underlying nondeterministic suffix automaton and apply it to the text instead of to the pattern. The resulting algorithm is surprisingly simple, and efficient for relatively short patterns and small alphabet sizes
General Suffix Automaton Construction Algorithm and Space Bounds
, 2009
"... Suffix automata and factor automata are efficient data structures for representing the full index of a set of strings. They are minimal deterministic automata representing the set of all suffixes or substrings of a set of strings. This paper presents a novel analysis of the size of the suffix automa ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
automaton or factor automaton of a set of strings. It shows that the suffix automaton or factor automaton of a set of strings U has at most 2Q − 2 states, where Q is the number of nodes of a prefixtree representing the strings in U. This bound significantly improves over 2‖U‖−1, the bound given by Blumer
A Bitparallel Suffix Automaton Approach for (δ, γ)Matching in Music Retrieval
"... (delta,gamma)Matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P1...m and a text T1...n on an alphabet of integers, find the occurrences P of the pattern in the text such that (i) 81 i m; jP i P i j . Several techniques for (delta,gamma)mat ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(delta,gamma)Matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P1...m and a text T1...n on an alphabet of integers, find the occurrences P of the pattern in the text such that (i) 81 i m; jP i P i j . Several techniques for (delta,gamma)matching have been proposed. In this paper we show that a classical string matching technique that combines bitparallelism and sux automata can be successfully adapted to this problem. This is the first characterskipping algorithm that skips characters using both delta and gamma. We implemented our algorithm and drew experimental results on real music showing that our algorithm is superior to current alternatives.
Factor oracle, Suffix oracle
, 1999
"... We introduce a new automaton on a word p, sequence of letters taken in an alphabet \Sigma, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m + 1 states and a linear number of transitions. We give an online construction algorithm of the factor orac ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
oracle. The tight links between this structure and the suffix automaton allows us to introduce a second structure : the suffix oracle. We use these two structures in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as efficient
Fast and Flexible String Matching by Combining Bitparallelism and Suffix Automata
 ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS (JEA
, 1998
"... ... In this paper we merge bitparallelism and suffix automata, so that a nondeterministic suffix automaton is simulated using bitparallelism. The resulting algorithm, called BNDM, obtains the best from both worlds. It is much simpler to implement than BDM and nearly as simple as ShiftOr. It inher ..."
Abstract

Cited by 74 (10 self)
 Add to MetaCart
... In this paper we merge bitparallelism and suffix automata, so that a nondeterministic suffix automaton is simulated using bitparallelism. The resulting algorithm, called BNDM, obtains the best from both worlds. It is much simpler to implement than BDM and nearly as simple as Shift
A Bitparallel Approach to Suffix Automata: Fast Extended String Matching
, 1998
"... . We present a new algorithm for string matching. The algorithm, called BNDM, is the bitparallel simulation of a known (but recent) algorithm called BDM. BDM skips characters using a "suffix automaton " which is made deterministic in the preprocessing. BNDM, instead, simulates the nondete ..."
Abstract

Cited by 53 (5 self)
 Add to MetaCart
. We present a new algorithm for string matching. The algorithm, called BNDM, is the bitparallel simulation of a known (but recent) algorithm called BDM. BDM skips characters using a "suffix automaton " which is made deterministic in the preprocessing. BNDM, instead, simulates
Factor oracle, Suffix oracle (Extended Abstract)
"... We introduce a new automaton on a word p, sequence of letters taken in an alphabet \Sigma, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m + 1 states and a linear number of transitions. We give an online construction algorithm of the factor orac ..."
Abstract
 Add to MetaCart
oracle. The tight links between this structure and the suffix automaton allows us to introduce a second structure, the suffix oracle. We use these two structures in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as efficient
Dictionary Automaton in Optimal Space
, 1999
"... . In this paper we describe the data structure of a time and space efficient string dictionary automaton, providing insertion and deletion of strings and finite state machine based substring searching. If the input alphabet is bounded and the pattern are mutually substring free an optimal worst ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(jxj). The novelity of the approach is to realize a multi suffix tree based finite state automaton for substring ...
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. LNCS 7276
"... Abstract. Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Automata play a very important role in the design of efficient soluti ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
solutions for the exact stringmatching problem. Inthis paper we propose a new very simple solution which turns out to be very efficient in practical cases. It is based on a suitable factorization of the pattern and on a straightforward and light encoding of the suffix automaton. It turns out that on average
Results 1  10
of
64