81 search results - page 7 / 17 » Repetition-free longest common subsequence |
CJ
2008
13 years 7 months ago
2008
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
DIS
2006
Springer
13 years 11 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
ENGL
2007
13 years 7 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
SPIRE
2001
Springer
13 years 11 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...