Fishing for minimum evolution trees with neighbor-nets

DOI10.1016/j.ipl.2013.10.003zbMath1332.92039OpenAlexW1981765994MaRDI QIDQ2350587

Andreas Spillner, Sarah Bastkowski, Vincent L. Moulton

Publication date: 25 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsdynamic programmingphylogenetic networkphylogeneticsminimum evolutioncircular split system

Mathematics Subject Classification ID

Problems related to evolution (92D15) Algorithms in computer science (68W99)

Related Items (1)

Neighborhoods of trees in circular orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The neighbor-net algorithm
• Seeing the trees and their branches in the network is hard
• A canonical decomposition theory for metrics on a finite set
• Simple algorithms for the on-line multidimensional dictionary and related problems
• Locating a tree in a phylogenetic network
• A robust model for finding optimal evolutionary tree
• Optimal algorithms for computing edge weights in planar split networks
• Finding a maximum likelihood tree is hard
• The minimum evolution problem: Overview and classification

This page was built for publication: Fishing for minimum evolution trees with neighbor-nets