Sciweavers

3604 search results - page 7 / 721
» All Common Subsequences
Sort
View
PR
2011
13 years 2 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
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...
Silvia García-Díez, François ...
JCC
2011
154views more  JCC 2011»
12 years 10 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: 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 ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
DIS
2006
Springer
13 years 11 months ago
A New Family of String Classifiers Based on Local Relatedness
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&...
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masay...
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 1 months ago
Approximate Structural Matching over Ordered XML Documents
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...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
SPIRE
2001
Springer
13 years 11 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
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...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...