Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations

DOI10.1007/s00285-015-0899-7zbMath1330.05150OpenAlexW623848599WikidataQ46720341 ScholiaQ46720341MaRDI QIDQ2634749

Taoyang Wu, Katharina T. Huber, Simone Linz, Vincent L. Moulton

Publication date: 18 February 2016

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

Full work available at URL: https://ueaeprints.uea.ac.uk/id/eprint/54718/1/NNI_Network_JMB_rev.pdf

zbMATH Keywords

phylogenetic networksnearest-neighbor interchange (NNI)phylogenetic tree metricsspaces of phylogenetic trees

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items

Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Transforming phylogenetic networks: moving beyond tree space ⋮ Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks ⋮ Uprooted phylogenetic networks ⋮ The SNPR neighbourhood of tree-child networks ⋮ Exploring spaces of semi-directed level-1 networks ⋮ On the subnet prune and regraft distance ⋮ Bounds for phylogenetic network space metrics ⋮ A cubic-time algorithm for computing the trinet distance between level-1 networks ⋮ Encoding and ordering \(X\)-cactuses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On encodings of phylogenetic networks of bounded level
• Reconstructing a phylogenetic level-1 network from quartets
• On agreement forests
• All that glisters is not galled
• Geometry of the space of phylogenetic trees
• On the computational complexity of the rooted subtree prune and regraft distance
• A parsimony-based metric for phylogenetic trees
• Encoding and constructing 1-nested phylogenetic networks with trinets
• Bounding the number of hybridisation events for a consistent evolutionary history
• The Structure of Level-k Phylogenetic Networks
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Comparison of labeled trees with valency three
• Subtree transfer operations and their induced metrics on evolutionary trees
• Sorting with fixed-length reversals