Sciweavers

Share
RECOMB
2007
Springer

Improving Inversion Median Computation Using Commuting Reversals and Cycle Information

10 years 2 months ago
Improving Inversion Median Computation Using Commuting Reversals and Cycle Information
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 for reconstructing phylogeny from genome rearrangements include distance-based methods, MCMC methods and direct optimization methods. The latter, pioneered by Sankoff and extended with the software suite GRAPPA and MGR, is the most accurate approach, but is very limited due to the difficulty of its scoring procedure?it must solve multiple instances of median problem to compute the score of a given tree. The median problem is known to be NP-hard and all existing solvers are extremely slow when the genomes are distant. In this paper, we present a new inversion median heuristic for unichromisomal genomes. The new method works by applying sets of reversals in a batch where all such reversals both commute and do not break the cycle of any other. Our testing using simulated datasets shows that this method is much f...
William Arndt, Jijun Tang
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2007
Where RECOMB
Authors William Arndt, Jijun Tang
Comments (0)
books