ISIPhyNC - Class: binary tree-child
Definition
A phylogenetic network is
binary tree-child if it is
binary and it is
tree-child. [
reference]
Bibliographic references on the Who is who in phylogenetic networks
Relationships with other phylogenetic network classes
Maximum subclasses
Minimum superclasses
- binary nearly stable [reference] (Noting that binary tree-child networks can be defined as binary phylogenetic networks whose vertices are all stable implies that binary tree-child networks are particular cases of nearly-stable networks.)
- binary nearly tree-child
- binary stable-child (For any internal vertex v of a tree-child network, we consider a directed path starting from v, obtained in the following way: among the children of the lowest vertices of the path built so far, one is a tree-child, so we add it to the path. The path eventually reaches a leaf l, and the child c of v contained by this path is stable for l as there is no reticulation vertex on the path from c to l.)
Problems
Positive results proved for this class
Positive results deduced from superclasses
Negative results proved for this class
Negative results deduced from subclasses
No negative result could be deduced from subclasses.
Properties
Properties proved for this class
Properties deduced from superclasses
Properties deduced from subclasses
No property could be deduced from subclasses.
Examples of networks
In this class
proved directly:
no network found in this class with a direct proof
Deduced from class inclusions: network #5 (deduced from the inclusion of "binary unicyclic" in this class), network #6 (deduced from the inclusion of "binary galled tree" in this class), network #7 (deduced from the inclusion of "binary normal" in this class), network #13 (deduced from the inclusion of "binary normal" in this class), network #22 (deduced from the inclusion of "binary normal" in this class), network #15 (deduced from the inclusion of "binary normal" in this class)
Not in this class
Proved directly:
no network found outside this class with a direct proof
Deduced from class inclusions: network #17 (deduced from the inclusion of this class in "binary nearly stable"), network #14 (deduced from the inclusion of this class in "binary tree-sibling"), network #12 (deduced from the inclusion of this class in "binary compressed"), network #11 (deduced from the inclusion of this class in "binary reticulation-visible"), network #21 (deduced from the inclusion of this class in "binary nearly stable"), network #1 (deduced from the inclusion of this class in "binary tree-sibling"), network #10 (deduced from the inclusion of this class in "binary tree-based"), network #24 (deduced from the inclusion of this class in "binary reticulation-visible"), network #19 (deduced from the inclusion of this class in "binary nearly stable"), network #8 (deduced from the inclusion of this class in "binary nearly stable"), network #2 (deduced from the inclusion of this class in "binary tree-sibling"), network #3 (deduced from the inclusion of this class in "binary tree-based"), network #4 (deduced from the inclusion of this class in "binary nearly tree-child")
About this website
This website was programmed and is maintained by Philippe Gambette.
It was started during the internship of Maxime Morgado at LIGM, in June-July 2015,
and also contains contributions made from Narges Tavassoli from November 2016 to January 2017.
Please contact Philippe Gambette if you have any suggestions about this website, especially about problems, properties, results or subclasses to add.
How to cite
P. Gambette, M. Morgado, N. Tavassoli & M. Weller (2018)
ISIPhyNC, an Information System on Inclusions of Phylogenetic Network Classes, manuscript in preparation.
Database content
73 classes of phylogenetic networks including 35 classes of binary phylogenetic networks (defined in a total of 20 bibliographic references), 51 inclusion relationships proved directly between classes (including some found in a total of 9 bibliographic references), 24 networks (68 memberships to a class, 56 non-memberships to a class), 3 problems considered, 3 properties considered, 37 theorems proved directly (including some found in a total of 17 bibliographic references) including 26 positive results (which can be extended to subclasses) and 11 negative results (which can be extended to superclasses).