1383 search results - page 212 / 277 » On the Complexity of the Interlace Polynomial |
123
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
RECOMB
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
112
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
116
click to vote
RECOMB
2008
Springer
16 years 2 months ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
131
click to vote
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...