71 search results - page 4 / 15 » Comparisons of sequence labeling algorithms and extensions |
ISPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
Whole genome comparison consists of comparing or aligning genome sequences with a goal of finding similarities between them. Previously we have shown how SIMD Extensions used in ...
BMCBI
2007
13 years 8 months ago
2007
Background: Design of protein structure comparison algorithm is an important research issue, having far reaching implications. In this article, we describe a protein structure com...
VLDB
1999
ACM
14 years 24 days ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
KDD
2005
ACM
14 years 2 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
JCB
2000
13 years 8 months ago
2000
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...