34 search results - page 1 / 7 » Heuristics for the inversion median problem |
BMCBI
2010
13 years 5 months ago
2010
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
WABI
2001
Springer
13 years 9 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
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...
HEURISTICS
2002
13 years 4 months ago
2002
