Classes of explicit phylogenetic networks and their biological and mathematical significance
From MaRDI portal
Publication:2140011
DOI10.1007/s00285-022-01746-yzbMath1491.92088arXiv2109.10251OpenAlexW3199832604WikidataQ113905375 ScholiaQ113905375MaRDI QIDQ2140011
Kristina Wicke, Joan Carles Pons, Sungsik Kong, Laura S. Kubatko
Publication date: 20 May 2022
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.10251
Related Items (8)
Labellable phylogenetic networks ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Computing consensus networks for collections of 1-nested phylogenetic networks ⋮ Finding agreement cherry-reduced subnetworks in level-1 networks ⋮ Enumeration of rooted binary unlabeled galled trees ⋮ A branching process with coalescence to model random phylogenetic networks ⋮ Generation of orchard and tree-child networks ⋮ Phylogenetic network classes through the lens of expanding covers
Uses Software
Cites Work
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- Reticulation-visible networks
- Determining phylogenetic networks from inter-taxa distances
- On the existence of infinitely many universal tree-based networks
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
- Folding and unfolding phylogenetic trees and networks
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Identifiability of large phylogenetic mixture models
- On encodings of phylogenetic networks of bounded level
- Phylogenetic networks that display a tree twice
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Detecting hybrid speciation in the presence of incomplete lineage sorting using gene tree incongruence: a model
- Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent
- Recovering normal networks from shortest inter-taxa distance information
- Constructing tree-child networks from distance matrices
- Path lengths in tree-child time consistent hybridization networks
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Comparison of phylogenetic trees
- The coalescent
- A canonical decomposition theory for metrics on a finite set
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks
- Locating a tree in a phylogenetic network
- Reconstruction of LGT networks from tri-LGT-nets
- Identifiability and reconstructibility of species phylogenies under a modified coalescent
- Identifying species network features from gene tree quartets under the coalescent model
- A framework for representing reticulate evolution
- Computing the maximum agreement of phylogenetic networks
- A universal tree-based network with the minimum number of reticulations
- Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
- When is a phylogenetic network simply an amalgamation of two trees?
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- Caterpillars on three and four leaves are sufficient to binary normal networks
- On cherry-picking and network containment
- Identifiability in phylogenetics using algebraic matroids
- Trinets encode orchard phylogenetic networks
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Defining phylogenetic networks using ancestral profiles
- Trinets encode tree-child and level-2 phylogenetic networks
- Phylogenetic networks that are their own fold-ups
- A class of phylogenetic networks reconstructable from ancestral profiles
- Binets: fundamental building blocks for phylogenetic networks
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Properties of normal phylogenetic networks
- On the quirks of maximum parsimony and likelihood on phylogenetic networks
- Fast algorithm for the reconciliation of gene trees and LGT networks
- Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites
- Phylogenetic networks from multi-labelled trees
- Identifiability of the unrooted species tree topology under the coalescent model with time-reversible substitution processes, site-specific rate variation, and invariable sites
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
- Locating a Tree in a Phylogenetic Network in Quadratic Time
- Phylogeny
- The Fine Structure of Galls in Phylogenetic Networks
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Distinguishing Phylogenetic Networks
- On Computing the Maximum Parsimony Score of a Phylogenetic Network
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Classes of explicit phylogenetic networks and their biological and mathematical significance
