Natural family-free genomic distance
Abstract Background A classical problem in comparative genomics is to compute the rearrangement distance, that is the minimum number of large-scale rearrangements required to transform a given genome into another given genome. The traditional approaches in this area are family-based, i.e., require t...
Main Authors: | Diego P. Rubert, Fábio V. Martinez, Marília D. V. Braga |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2021-05-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | https://doi.org/10.1186/s13015-021-00183-8 |
Similar Items
-
Natural family-free genomic distance
by: Braga, M.D.V, et al.
Published: (2021) -
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes
by: Guillaume Fertin, et al.
Published: (2017-06-01) -
Estimation of the true evolutionary distance under the fragile breakage model
by: Nikita Alexeev, et al.
Published: (2017-05-01) -
Implicit Transpositions in DCJ Scenarios
by: Pavel Avdeyev, et al.
Published: (2017-12-01) -
A general framework for genome rearrangement with biological constraints
by: Pijus Simonaitis, et al.
Published: (2019-07-01)