Computing the family-free DCJ similarity
Abstract Background The genomic similarity is a large-scale measure for comparing two given genomes. In this work we study the (NP-hard) problem of computing the genomic similarity under the DCJ model in a setting that does not assume that the genes of the compared genomes are grouped into gene fami...
Main Authors: | Diego P. Rubert, Edna A. Hoshino, Marília D. V. Braga, Jens Stoye, Fábio V. Martinez |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2018-05-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12859-018-2130-5 |
Similar Items
-
Recombinations, chains and caps: resolving problems with the DCJ-indel model
by: Leonard Bohnenkämper
Published: (2024-02-01) -
Investigating the complexity of the double distance problems
by: Marília D. V. Braga, et al.
Published: (2024-01-01) -
Efficient gene orthology inference via large-scale rearrangements
by: Diego P. Rubert, et al.
Published: (2023-09-01) -
DCJ-RNA - double cut and join for RNA secondary structures
by: Ghada H. Badr, et al.
Published: (2017-10-01) -
Natural family-free genomic distance
by: Diego P. Rubert, et al.
Published: (2021-05-01)