Heuristic algorithms for best match graph editing
Background: Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as a representation of the pairwise most closely related genes among multiple species. An arc connects a gene x with a gene y from another species (vertex color) Y whenever it is...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |