Heuristic algorithms for best match graph editing

Heuristic algorithms for best match graph editing

Abstract 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 wheneve...

Full description

Bibliographic Details
Main Authors: David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler
Format: Article
Language:English
Published: BMC 2021-08-01
Series:Algorithms for Molecular Biology
Subjects:
Arc modification problems
Heuristic algorithm
Consistent algorithm
NP-hardness
Online Access:https://doi.org/10.1186/s13015-021-00196-3

Internet

https://doi.org/10.1186/s13015-021-00196-3

Similar Items