A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions


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… (More)
DOI: 10.1186/1471-2105-9-516


6 Figures and Tables

Slides referencing similar topics