6 search results - page 1 / 2 » Linear-Time Algorithms for Computing Maximum-Density Sequenc... |
CORR
2002
Springer
13 years 6 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
JMLR
2008
13 years 6 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
ICML
2006
IEEE
14 years 7 months ago
2006
IEEE
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
BMCBI
2004
13 years 6 months ago
2004
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
CSB
2004
IEEE
13 years 10 months ago
2004
IEEE
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...