11 search results - page 2 / 3 » A fast algorithm for the multiple genome rearrangement probl... |
JDA
2007
13 years 4 months ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
TCS
2008
13 years 4 months ago
2008
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
BMCBI
2006
13 years 4 months ago
2006
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
RECOMB
2010
Springer
13 years 3 months ago
2010
Springer
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...