Limits...
How much information is needed to infer reticulate evolutionary histories?

Huber KT, Van Iersel L, Moulton V, Wu T - Syst. Biol. (2014)

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.

View Article: PubMed Central - PubMed

Affiliation: School of Computing Sciences, University of East Anglia, Norwich, UK, and Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands.

Show MeSH
Constructing the network  from the network  in the case . At each stage, we indicate those vertices that have been inserted by unfilled circles. i) The network  in which the root has been replaced by the tree . ii) The network  with the vertices in the middle layer indicated by squares. The tree  is indicated in bold. iii) The network . The tree  associated to the binary sequence  is indicated in bold. iv) The network  obtained by suppressing all vertices in  having indegree and outdegree equal to one.
© Copyright Policy - creative-commons
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4265143&req=5

Figure 4: Constructing the network from the network in the case . At each stage, we indicate those vertices that have been inserted by unfilled circles. i) The network in which the root has been replaced by the tree . ii) The network with the vertices in the middle layer indicated by squares. The tree is indicated in bold. iii) The network . The tree associated to the binary sequence is indicated in bold. iv) The network obtained by suppressing all vertices in having indegree and outdegree equal to one.

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.


How much information is needed to infer reticulate evolutionary histories?

Huber KT, Van Iersel L, Moulton V, Wu T - Syst. Biol. (2014)

Constructing the network  from the network  in the case . At each stage, we indicate those vertices that have been inserted by unfilled circles. i) The network  in which the root has been replaced by the tree . ii) The network  with the vertices in the middle layer indicated by squares. The tree  is indicated in bold. iii) The network . The tree  associated to the binary sequence  is indicated in bold. iv) The network  obtained by suppressing all vertices in  having indegree and outdegree equal to one.
© Copyright Policy - creative-commons
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4265143&req=5

Figure 4: Constructing the network from the network in the case . At each stage, we indicate those vertices that have been inserted by unfilled circles. i) The network in which the root has been replaced by the tree . ii) The network with the vertices in the middle layer indicated by squares. The tree is indicated in bold. iii) The network . The tree associated to the binary sequence is indicated in bold. iv) The network obtained by suppressing all vertices in having indegree and outdegree equal to one.
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.

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.

View Article: PubMed Central - PubMed

Affiliation: School of Computing Sciences, University of East Anglia, Norwich, UK, and Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands.

Show MeSH