On encodings of phylogenetic networks of bounded level
From MaRDI portal
(Redirected from Publication:455730)
Abstract: Driven by the need for better models that allow one to shed light into the question how life's diversity has evolved, phylogenetic networks have now joined phylogenetic trees in the center of phylogenetics research. Like phylogenetic trees, such networks canonically induce collections of phylogenetic trees, clusters, and triplets, respectively. Thus it is not surprising that many network approaches aim to reconstruct a phylogenetic network from such collections. Related to the well-studied perfect phylogeny problem, the following question is of fundamental importance in this context: When does one of the above collections encode (i.e. uniquely describe) the network that induces it? In this note, we present a complete answer to this question for the special case of a level-1 (phylogenetic) network by characterizing those level-1 networks for which an encoding in terms of one (or equivalently all) of the above collections exists. Given that this type of network forms the first layer of the rich hierarchy of level-k networks, k a non-negative integer, it is natural to wonder whether our arguments could be extended to members of that hierarchy for higher values for k. By giving examples, we show that this is not the case.
Recommendations
- Trinets encode tree-child and level-2 phylogenetic networks
- Level-\(2\) networks from shortest and longest distances
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Encoding and constructing 1-nested phylogenetic networks with trinets
Cites work
- scientific article; zbMATH DE number 1945177 (Why is no real title available?)
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- All that glisters is not galled
- Analogs & duals of the MAST problem for sequences & trees
- Combinatorial optimization and hierarchical classifications
- Computing the maximum agreement of phylogenetic networks
- Computing the maximum agreement of phylogenetic networks
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- Phylogenetic networks from multi-labelled trees
- Seeing the trees and their branches in the network is hard
- Some uses of the Farris transform in mathematics and phylogenetics -- A review
- The Structure of Level-k Phylogenetic Networks
- Unique solvability of certain hybrid networks from their distances
- Weak hierarchies associated with similarity measures - An additive clustering technique
Cited in
(24)- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Trinets encode orchard phylogenetic networks
- Trinets encode tree-child and level-2 phylogenetic networks
- Beyond representing orthology relations by trees
- Encodings of cladograms and labeled trees
- Level-\(2\) networks from shortest and longest distances
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Computing the rooted triplet distance between galled trees by counting triangles
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Display sets of normal and tree-child networks
- An efficient algorithm for the rooted triplet distance between galled trees
- Computing the rooted triplet distance between phylogenetic networks
- Computing consensus networks for collections of 1-nested phylogenetic networks
- A class of phylogenetic networks reconstructable from ancestral profiles
- The weighted total cophenetic index: a novel balance index for phylogenetic networks
- An algorithm for reconstructing level-2 phylogenetic networks from trinets
- Uprooted phylogenetic networks
- Reconstruction of LGT networks from tri-LGT-nets
- Caterpillars on three and four leaves are sufficient to binary normal networks
- Comparing and simplifying distinct-cluster phylogenetic networks
- Encoding and ordering X-cactuses
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
This page was built for publication: On encodings of phylogenetic networks of bounded level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455730)
