scientific article; zbMATH DE number 6316795
From MaRDI portal
Publication:5169884
zbMath1316.92001MaRDI QIDQ5169884
Publication date: 14 July 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Research exposition (monographs, survey articles) pertaining to biology (92-02)
Related Items (37)
Binets: fundamental building blocks for phylogenetic networks ⋮ Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology ⋮ Non-essential arcs in phylogenetic networks ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Enumeration of binary trees compatible with a perfect phylogeny ⋮ Transforming phylogenetic networks: moving beyond tree space ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ 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 ⋮ Folding and unfolding phylogenetic trees and networks ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ The Sackin index of simplex networks ⋮ Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks ⋮ Tree Containment With Soft Polytomies ⋮ Uprooted phylogenetic networks ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ The hybrid number of a ploidy profile ⋮ Developments in coalescent theory from single loci to chromosomes ⋮ The agreement distance of unrooted phylogenetic networks ⋮ Bounding the number of reticulations in a tree-child network that displays a set of trees ⋮ Counting and enumerating galled networks ⋮ Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Ancestries of a recombining diploid population ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Finding a most parsimonious or likely tree in a network with respect to an alignment ⋮ On the subnet prune and regraft distance ⋮ Deciding the existence of a cherry-picking sequence is hard on two trees ⋮ A cubic-time algorithm for computing the trinet distance between level-1 networks ⋮ Phylogenetic networks that are their own fold-ups ⋮ A decomposition theorem and two algorithms for reticulation-visible networks ⋮ Quantifying Genetic Innovation: Mathematical Foundations for the Topological Study of Reticulate Evolution ⋮ Unnamed Item ⋮ Locating a Tree in a Phylogenetic Network in Quadratic Time ⋮ Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks ⋮ The distribution of waiting distances in ancestral recombination graphs ⋮ Phylogenetics of Indo-European language families via an algebro-geometric analysis of their syntactic structures
This page was built for publication:
