Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
This article shows that tree-child networks of level \(k\), where \(k \geq 2\), are determined by their MLLS. A polynomial time algorithm for recovering such a network from their MLLS is derived. In this case, one of the properties of daughter trees was used -- the lowest node of the tree is in a cherry or net cherry. The obvious obstacle to this method is that there are no guarantees or reasons for obtaining a set of all MLLS of the source network. Converting sequence data to MLLS can be quite complex, especially for a higher level. To make the results practical, one can use similar approaches, for example, these are methods that work with subnets of only three leaves. However, it is not necessary to know all the MLLS to restore the original network: only three are needed. A possible application of this approach may be as follows. Assume that in different studies they created networks with some patterns. However, in each of these networks some actual mesh events were skipped, possibly due to computational limitations or lack of data. A method based on the theoretical results of this work can be used to reconstruct the entire network from networks with missing events. There is also the prospect of expanding MLLS reconstruction results for a more general class of networks. Since the authors' ultimate goal was to determine the reconstruction of networks from their MLLS, this can be done by analysis of a similar pair of leaves, but the authors obtained results for a large number of cases, with level 2 networks containing 15 possible forms. Accounting for level \(k\) generators can provide an interesting approach to this problem.
- Not all phylogenetic networks are leaf-reconstructible
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Leaf-reconstructibility of phylogenetic networks
- Reconstructibility of unrooted level-k phylogenetic networks from distances
- Binets: fundamental building blocks for phylogenetic networks
- Constructing tree-child networks from distance matrices
- Determining phylogenetic networks from inter-taxa distances
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Properties of normal phylogenetic networks
- Reconstructing evolution of sequences subject to recombination using parsimony
- Recovering normal networks from shortest inter-taxa distance information
- Research in Computational Molecular Biology
- Research in Computational Molecular Biology
- Trinets encode tree-child and level-2 phylogenetic networks
- Identifiability of local and global features of phylogenetic networks from average distances
- The tree of blobs of a species network: identifiability under the coalescent
- Non-essential arcs in phylogenetic networks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Reconstructibility of unrooted level-k phylogenetic networks from distances
- Caterpillars on three and four leaves are sufficient to binary normal networks
- On cherry-picking and network containment
- A class of phylogenetic networks reconstructable from ancestral profiles
- Not all phylogenetic networks are leaf-reconstructible
- Leaf-reconstructibility of phylogenetic networks
- Combining Networks Using Cherry Picking Sequences
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
- Orienting undirected phylogenetic networks
- When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
This page was built for publication: Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008245)
