How much information is needed to infer reticulate evolutionary histories?
Bottom Line: Namely, we show that even if we are given all of the subnetworks induced on all proper subsets of the leaves of some rooted phylogenetic network, we still do not have all of the information required to completely determine that network.This implies that even if all of the building blocks for some reticulate evolutionary history were to be taken as the input for any given network building method, the method might still output an incorrect history.We also discuss some potential consequences of this result for constructing phylogenetic networks.
Affiliation: School of Computing Sciences, University of East Anglia, Norwich, UK, and Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands.Show MeSH
Mentions: Let and . Starting with the rooted DAGs defined in the previous section, we shall define a sequence of three rooted DAGs all having leaf set , the last one of which will yield . We illustrate this process in Figure 4, for the rooted DAG depicted in Figure 3.
Affiliation: School of Computing Sciences, University of East Anglia, Norwich, UK, and Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands.