39 search results - page 3 / 8 » recomb 2010 |
80
Voted
RECOMB
2010
Springer
15 years 8 months ago
2010
Springer
RECOMB
2010
Springer
15 years 8 months ago
2010
Springer
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate ...
161
click to vote
RECOMB
2010
Springer
15 years 11 days ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
118
click to vote
RECOMB
2010
Springer
14 years 12 months ago
2010
Springer
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
123
click to vote
RECOMB
2010
Springer
15 years 11 days ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...