Cargando…
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...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8369769/ https://www.ncbi.nlm.nih.gov/pubmed/34404422 http://dx.doi.org/10.1186/s13015-021-00196-3 |