A robust model for finding optimal evolutionary tree
From MaRDI portal
(Redirected from Publication:1902471)
Recommendations
Cites work
- scientific article; zbMATH DE number 432794 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- A molecular sequence metric and evolutionary trees
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Fast Algorithms for Finding Nearest Common Ancestors
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- On the hardness of approximating minimization problems
- Sequence comparison with concave weighting functions
- Simple method for constructing phylogenetic trees from distance matrices.
- The complexity of reconstructing trees from qualitative characters and subtrees
- The complexity of ultrametric partitions on graphs
- The structure and construction of taxonomic hierarchies
Cited in
(44)- Testing metric properties
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
- scientific article; zbMATH DE number 1754590 (Why is no real title available?)
- Tree reconstruction from triplet cover distances
- A distance-based model for convergent evolution
- scientific article; zbMATH DE number 1945171 (Why is no real title available?)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- An algorithm for the fitting of a tree metric according to a weighted least-squares criterion
- Tree Reconstruction from Partial Orders
- Completion of tree metrics and rank 2 matrices
- A fast algorithm for constructing trees from distance matrices
- Towards optimal distance functions for stochastic substitution models
- A constructive algorithm for realizing a distance matrix
- An algorithm for finding a representation of a subtree distance
- The balanced minimum evolution problem under uncertain data
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
- scientific article; zbMATH DE number 2079368 (Why is no real title available?)
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
- Fishing for minimum evolution trees with neighbor-nets
- On the extension of a partial metric to a tree metric
- \(l_\infty\)-approximation via subdominants.
- A structured family of clustering and tree construction methods
- A few logs suffice to build (almost) all trees. II
- Maximal sub-triangulation in pre-processing phylogenetic data
- An evolutionary approach for finding optimal trees in undirected networks
- On the hardness of inferring phylogenies from triplet-dissimilarities
- A branch-price-and-cut algorithm for the minimum evolution problem
- Reconstructing a history of recombinations from a set of sequences
- Semi‐labeled unrooted binary tree optimization subject to nonnegativity
- Tree edge decomposition with an application to minimum ultrametric tree approximation
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform
- Discrete convexity in joint winner property
- scientific article; zbMATH DE number 1405794 (Why is no real title available?)
- Approximation algorithms for the shortest total path length spanning tree problem
- Finding the closest ultrametric
- A note on tree realizations of matrices
- A new approximation guarantee for monotone submodular function maximization via discrete convexity
- The minimum evolution problem: Overview and classification
- Distinguished minimal topological lassos
- Mathematical Foundations of Computer Science 2005
- UPGMA and the normalized equidistant minimum evolution problem
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
- Algorithms and Computation
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
This page was built for publication: A robust model for finding optimal evolutionary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902471)
