Reconstructing the shape of a tree from observed dissimilarity data
From MaRDI portal
Publication:103560
DOI10.1016/0196-8858(86)90038-2zbMath0613.62083MaRDI QIDQ103560
Hans-Jürgen Bandelt, Andreas W. M. Dress, Andreas W. M. Dress, Hans-Jürgen Bandelt
Publication date: September 1986
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(86)90038-2
algorithms; hierarchical classification; dissimilarity index; neighbors relation; topological tree structures; tree-like data
62H30: Classification and discrimination; cluster analysis (statistical aspects)
Related Items
Likelihood-mapping: A simple method to visualize phylogenetic content of a sequence alignment, An optimal parallel algorithm to construct a tree 3-spanner on interval graphs, Patchworks, Analyzing and visualizing sequence and distance data using SPLITSTREE, Quartet, Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces, Full reconstruction of Markov models on evolutionary trees: identifiability and consistency., Representations of graphs and networks (coding, layouts and embeddings), A canonical decomposition theory for metrics on a finite set, Convex tree realizations of partitions, On sparse spanners of weighted graphs, The complexity of reconstructing trees from qualitative characters and subtrees, Spectral analysis and a closest tree method for genetic sequences, Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results, Retractions of finite distance functions onto tree metrics, Distance measures in terms of substitution processes, Patching up \(X\)-trees, What can and what cannot be inferred from pairwise sequence comparisons?, NP-completeness of minimum spanner problems, Recovering a tree from the leaf colourations it generates under a Markov model, Trees, taxonomy, and strongly compatible multi-state characters, Restrictions of minimum spanner problems, A phase transition for a random cluster model on phylogenetic trees., Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction., A note on maximal hierarchies, Inferring evolutionary trees with strong combinatorial evidence, On the consistency of the minimum evolution principle of phylogenetic inference, A fixed-parameter algorithm for minimum quartet inconsistency, Tree spanners on chordal graphs: complexity and algorithms, A few logs suffice to build (almost) all trees. II, Tree representations of non-symmetric group-valued proximities, A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance, Additive sparse spanners for graphs with bounded length of largest induced cycle
