A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions |
| |
| Authors: | Martin Bader Mohamed I Abouelhoda Enno Ohlebusch |
| |
| Affiliation: | (1) Institute of Theoretical Computer Science,University of Ulm, 89069 Ulm, Germany;(2) Faculty of Engineering, Cairo University, Giza, Egypt;(3) Nile University, Giza, Egypt |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
