35 search results - page 2 / 7 » recomb 2007 |
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruc...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
RECOMB
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Accurately reconstructing the large-scale gene order in an ancestral genome is a critical step to better understand genome evolution. In this paper, we propose a heuristic algorith...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...