Comparing and Aggregating Partially Resolved Trees
From MaRDI portal
Publication:5458518
Recommendations
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 1405796 (Why is no real title available?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Comparing Partial Rankings
- Comparison of phylogenetic trees
- Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
- Metric methods for analyzing partially ranked data
- N-trees as nestings: Complexity, similarity, and consensus
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Subtree transfer operations and their induced metrics on evolutionary trees
- The median procedure for n-trees
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(5)
This page was built for publication: Comparing and Aggregating Partially Resolved Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458518)