A binary phylogenetic network may or may not be obtainable from a tree by the addition of directed edges (arcs) between tree arcs. Here, we establish a precise and easily tested criterion (based on `2-SAT') that efficiently determines whether or not any given network can be realized in this way. Moreover, the proof provides a polynomial-time algorithm for finding one or more trees (when they exist) on which the network can be based. A number of interesting consequences are presented as corollaries; these lead to some further relevant questions and observations, which we outline in the conclusion.
On Tree-Network Distinguishability and Full Identifiability of Phylogenetic Networks
Delft Institute of Applied Mathematics, Delft University of Technology(代尔夫特理工大学应用数学研究所);European Molecular Biology Laboratory, European Bioinformatics Institute (EMBL-EBI)(欧洲分子生物学实验室欧洲生物信息学研究所)
Characterizing semi-directed phylogenetic networks and their multi-rootable variants
Delft Institute of Applied Mathematics, Delft University of Technology(代尔夫特应用数学研究所,代尔夫特理工大学);School of Computing Sciences, University of East Anglia(东英吉利大学计算机科学学院)
TU Delft(代尔夫特理工大学);Middlesex University(密德萨斯大学);LIGM, Université Gustave Eiffel(拉格朗日计算与建模实验室,古斯塔夫·埃菲尔大学);Centre National de Recherche Scientifique(法国国家科学研究中心)