Fishing for minimum evolution trees with neighbor-nets
From MaRDI portal
Recommendations
Cites work
- A canonical decomposition theory for metrics on a finite set
- A robust model for finding optimal evolutionary tree
- Finding a maximum likelihood tree is hard
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- Introduction to algorithms.
- Locating a tree in a phylogenetic network
- Optimal algorithms for computing edge weights in planar split networks
- Seeing the trees and their branches in the network is hard
- Simple algorithms for the on-line multidimensional dictionary and related problems
- The minimum evolution problem: Overview and classification
- The neighbor-net algorithm
Cited in
(7)- The splits in the neighborhood of a tree
- Neighborhoods of trees in circular orderings
- Optimal algorithms for computing edge weights in planar split networks
- Biological Networks: Comparison, Conservation, and Evolutionary Trees
- Constructing circular phylogenetic networks from weighted quartets using simulated annealing
- scientific article; zbMATH DE number 1945177 (Why is no real title available?)
- The neighbor-net algorithm
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)