Fishing for minimum evolution trees with neighbor-nets
From MaRDI portal
Publication:2350587
DOI10.1016/J.IPL.2013.10.003zbMATH Open1332.92039OpenAlexW1981765994MaRDI QIDQ2350587FDOQ2350587
Authors: Sarah Bastkowski, Andreas Spillner, Vincent 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
Recommendations
algorithmsdynamic programmingphylogeneticsphylogenetic networkminimum evolutioncircular split system
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- A canonical decomposition theory for metrics on a finite set
- Simple algorithms for the on-line multidimensional dictionary and related problems
- A robust model for finding optimal evolutionary tree
- Finding a maximum likelihood tree is hard
- Title not available (Why is that?)
- Locating a tree in a phylogenetic network
- Seeing the trees and their branches in the network is hard
- The neighbor-net algorithm
- The minimum evolution problem: Overview and classification
- Optimal algorithms for computing edge weights in planar split networks
Cited In (7)
- Constructing circular phylogenetic networks from weighted quartets using simulated annealing
- Neighborhoods of trees in circular orderings
- Title not available (Why is that?)
- The neighbor-net algorithm
- The splits in the neighborhood of a tree
- Biological Networks: Comparison, Conservation, and Evolutionary Trees
- Optimal algorithms for computing edge weights in planar split networks
This page was built for publication: Fishing for minimum evolution trees with neighbor-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350587)
