Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs release_oq4njhqwgbdwhaf7cfomebimiy

by David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler

Published in Algorithms by MDPI AG.

2021   Volume 14, p110

Abstract

Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees. We prove that the property of a rooted, leaf-colored tree to be least resolved for some BMG is preserved by the contraction of inner edges. For the special case of two-colored BMGs, this leads to a characterization of the least resolved trees (LRTs) of binary-explainable trees and a simple, polynomial-time algorithm for the minimum cardinality completion of the arc set of a BMG to reach a BMG that can be explained by a binary tree.
In application/xml+jats format

Archived Files and Locations

application/pdf  565.3 kB
file_2axz37fivvfcrcm6pvvtcm3bv4
res.mdpi.com (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2021-03-29
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1999-4893
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3e8a2a71-12c7-43a1-9551-3a80853feae2
API URL: JSON