Inferring evolutionary trees with strong combinatorial evidence
type: Item
instance of: scholarly article
title: Inferring evolutionary trees with strong combinatorial evidence
zbMATH Open document ID: 0945.68101
DOI: 10.1016/S0304-3975(99)00235-2
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493303
zbMATH Keywords: phylogeny reconstruction
zbMATH Keywords: quartet method
zbMATH Keywords: exact polynomial algorithm
zbMATH Keywords: partially resolved tree
zbMATH Keywords: combinatorial technique
zbMATH Keywords: worst-case convergence rate
zbMATH Keywords: experimental study
author: Vincent Berry
author: O. Gascuel
describes a project that uses: PHYLIP
MaRDI profile type: Publication
cites work: Q4875208
cites work: Q4866243
cites work: Q4004078
cites work: Q4364581
cites work: Reconstructing the shape of a tree from observed dissimilarity data
cites work: A canonical decomposition theory for metrics on a finite set
cites work: Q4004055
cites work: A polynomial time algorithm for constructing the refined Buneman tree
cites work: A note on the metric properties of trees
cites work: Taxonomy with confidence
cites work: \(l_\infty\)-approximation via subdominants.
cites work: Tree structures for proximity data
cites work: Computational complexity of inferring phylogenies from dissimilarity matrices
cites work: Constructing big trees from short sequences
cites work: Q4228475
cites work: A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
cites work: Efficient algorithms for inferring evolutionary trees
cites work: The probabilities of rooted tree-shapes generated by random bifurcation
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Retractions of finite distance functions onto tree metrics
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
description: scientific article; zbMATH DE number 1493303