3604 search results - page 7 / 721 » All Common Subsequences |
158
Voted
PR
2011
14 years 10 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
155
Voted
JCC
2011
14 years 6 months ago
2011
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
104
Voted
DIS
2006
Springer
15 years 7 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&...
136
click to vote
IDEAS
2007
IEEE
15 years 10 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
111
click to vote
SPIRE
2001
Springer
15 years 8 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...