Article
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
BMC bioinformatics - 4 Dec 2008
Bader Martin, Abouelhoda Mohamed I, Ohlebusch Enno
Abstract excerpt
BACKGROUND: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. However, this phylogenetic reconstruction is a very challenging task. For the most simple distance measures (the breakpoint distance and the reversal distance), the problem is NP-hard even if one considers only three genomes. RESULTS: In...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.