Investigating the complexity of the double distance problems
Abstract Background Two genomes $$\mathbb {A}$$ A and $$\mathbb {B}$$ B over the same set of gene families form a canonical pair when each of them has exactly one gene from each family. Denote by $$n_*$$ n ∗ the number of common families of $$\mathbb {A}$$ A and $$\mathbb {B}$$ B . Different distanc...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2024-01-01
|
| Series: | Algorithms for Molecular Biology |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13015-023-00246-y |