scientific article; zbMATH DE number 5262727
From MaRDI portal
Publication:5456778
zbMath1253.92044MaRDI QIDQ5456778
C. Randal Linder, Luay Nakhleh, Jerry Sun, Anna Tholse, Bernard M. E. Moret, Tandy J. Warnow
Publication date: 14 April 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)
Related Items
Fast algorithms for the rooted triplet distance between caterpillars ⋮ Path lengths in tree-child time consistent hybridization networks ⋮ Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ Tripartitions do not always discriminate phylogenetic networks ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks ⋮ Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination ⋮ Phylogenetic networks from multi-labelled trees ⋮ Computing the maximum agreement of phylogenetic networks ⋮ Fast algorithms for computing the tripartition-based distance between phylogenetic networks ⋮ Computing the rooted triplet distance between phylogenetic networks
