Determining phylogenetic networks from inter-taxa distances

DOI10.1007/S00285-015-0950-8zbMATH Open1343.05147OpenAlexW2295797791WikidataQ40212702 ScholiaQ40212702MaRDI QIDQ304036FDOQ304036

Magnus Bordewich, Charles Semple

Publication date: 23 August 2016

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/17201/1/17201.pdf

Recommendations

• Constructing tree-child networks from distance matrices
• Recovering normal networks from shortest inter-taxa distance information
• Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
• Reconstruction of certain phylogenetic networks from their tree-average distances
• Unique solvability of certain hybrid networks from their distances

zbMATH Keywords

phylogenetic networkdistance methodstemporal networktree-child network

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Extending the limits of supertree methods
• Reconstruction of certain phylogenetic networks from their tree-average distances
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

Cited In (24)

• Identifiability of local and global features of phylogenetic networks from average distances
• Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies
• Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
• Autopolyploidy, allopolyploidy, and phylogenetic networks with horizontal arcs
• Determining triangulations and quadrangulations by boundary distances
• Level-\(2\) networks from shortest and longest distances
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Display sets of normal and tree-child networks
• Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
• Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
• Defining phylogenetic networks using ancestral profiles
• Generation of orchard and tree-child networks
• Phylogenetic network dissimilarity measures that take branch lengths into account
• On cherry-picking and network containment
• A class of phylogenetic networks reconstructable from ancestral profiles
• Finding agreement cherry-reduced subnetworks in level-1 networks
• Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions
• The SNPR neighbourhood of tree-child networks
• Caterpillars on three and four leaves are sufficient to binary normal networks
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Unique solvability of certain hybrid networks from their distances
• Recovering normal networks from shortest inter-taxa distance information
• Constructing tree-child networks from distance matrices
• Counting General Phylogenetic networks

Uses Software

• BIONJ

This page was built for publication: Determining phylogenetic networks from inter-taxa distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304036)