AbstractThe problem of aligning two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence similarity problem is the incremental string comparison problem, denoted Consecutive Suffix Alignment, which is, given two strings A and B, to compute the alignment solution of each suffix of A versus B.Here, we present two solutions to the Consecutive Suffix Alignment Problem under the LCS (Longest Common Subsequence) metric, where the LCS metric measures the subsequence of maximal length common to A and B. The first solution is an O(nL) time and space algorithm for constant alphabets, where the size of the compared strings is O(n) and L⩽n denotes the size...
We evaluate several orthographic word similarity measures in the context of bitext word alignment. W...
Abstract. We consider the classic problem of computing (the length of) the longest common subsequenc...
We investigate the behavior of optimal alignment paths for related and non-related random sequences....
AbstractThe problem of aligning two sequences A and B to determine their similarity is one of the fu...
Abstract. The Local Alignment problem is a classical problem with ap-plications in biology. Given tw...
We consider an index data structure for similar strings. The generalized suffix tree can be a soluti...
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, t...
AbstractThe LCS problem is to determine a longest common subsequence (LCS) of two symbol sequences. ...
International audienceWe define a novel variation on the constrained sequence alignment problem in w...
International audienceThe classical algorithm for computing the similarity between two sequences [36...
International audienceGiven two strings of size n over a constant alphabet, the classical algorithm ...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
Abstract. Given two strings ofsize n over a constant alphabet, the classical algorithm for computing...
<p>The LCS of the two words (<i>w</i> and <i>c<sub>i</sub></i>) is “antsne”, and its similarity is 6...
[[abstract]]Consider two strings A and B of lengths n and m respectively, with n m. The problem of ...
We evaluate several orthographic word similarity measures in the context of bitext word alignment. W...
Abstract. We consider the classic problem of computing (the length of) the longest common subsequenc...
We investigate the behavior of optimal alignment paths for related and non-related random sequences....
AbstractThe problem of aligning two sequences A and B to determine their similarity is one of the fu...
Abstract. The Local Alignment problem is a classical problem with ap-plications in biology. Given tw...
We consider an index data structure for similar strings. The generalized suffix tree can be a soluti...
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, t...
AbstractThe LCS problem is to determine a longest common subsequence (LCS) of two symbol sequences. ...
International audienceWe define a novel variation on the constrained sequence alignment problem in w...
International audienceThe classical algorithm for computing the similarity between two sequences [36...
International audienceGiven two strings of size n over a constant alphabet, the classical algorithm ...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
Abstract. Given two strings ofsize n over a constant alphabet, the classical algorithm for computing...
<p>The LCS of the two words (<i>w</i> and <i>c<sub>i</sub></i>) is “antsne”, and its similarity is 6...
[[abstract]]Consider two strings A and B of lengths n and m respectively, with n m. The problem of ...
We evaluate several orthographic word similarity measures in the context of bitext word alignment. W...
Abstract. We consider the classic problem of computing (the length of) the longest common subsequenc...
We investigate the behavior of optimal alignment paths for related and non-related random sequences....