CPM
2009
Springer
13 years 8 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
CPM
2009
Springer
14 years 44 min ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
CPM
2009
Springer
14 years 2 months ago
2009
Springer
CPM
2009
Springer
14 years 2 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
CPM
2009
Springer
14 years 3 months ago
2009
Springer
CPM
2009
Springer
14 years 5 months ago
2009
Springer
CPM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
CPM
2009
Springer
14 years 5 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...