The distance and median problems in the single-cut-or-join model with single-gene duplications

The distance and median problems in the single-cut-or-join model with single-gene duplications

Abstract Background. In the field of genome rearrangement algorithms, models accounting for gene duplication lead often to hard problems. For example, while computing the pairwise distance is tractable in most duplication-free models, the problem is NP-complete for most extensions of these models ac...

Full description

Bibliographic Details
Main Authors: Aniket C. Mane, Manuel Lafond, Pedro C. Feijao, Cedric Chauve
Format: Article
Language:English
Published: BMC 2020-05-01
Series:Algorithms for Molecular Biology
Subjects:
Genomes rearrangement
Gene duplication
Genomic distance
Genome median
Online Access:http://link.springer.com/article/10.1186/s13015-020-00169-y

Internet

http://link.springer.com/article/10.1186/s13015-020-00169-y

Similar Items