Reconstructing the shape of a tree from observed dissimilarity data
From MaRDI portal
Publication:103560
DOI10.1016/0196-8858(86)90038-2zbMATH Open0613.62083OpenAlexW2042959539MaRDI QIDQ103560FDOQ103560
Authors: Hans-Jürgen Bandelt, Andreas W. M. Dress, Hans-Jürgen Bandelt, Andreas W. M. Dress 
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
Recommendations
algorithmsdissimilarity indexhierarchical classificationneighbors relationtopological tree structurestree-like data
Cites Work
- Comparison of phylogenetic trees
- Numbering binary trees with labeled terminal vertices
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- A probability measure for character compatibility
- Submatrices of non-tree-realizable distance matrices
- Free trees and bidirectional trees as representations of psychological distance
- Tree representations of ternary relations
- A note on the metric properties of trees
- Title not available (Why is that?)
- Tree structures for proximity data
- Unrooted trees for numerical taxonomy
- A note on the tree realizability of a distance matrix
Cited In (86)
- Kernel and fast algorithm for dense triplet inconsistency
- Graph spanners: a tutorial review
- Unanimity in attribute-based preference domains
- Minimum tree cost quartet puzzling
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Analytic solutions for three taxon ML trees with variable rates across sites
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
- On approximating tree spanners that are breadth first search trees
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- Labellable phylogenetic networks
- Generating sparse spanners for weighted graphs
- A phase transition for a random cluster model on phylogenetic trees.
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
- On the maximum quartet distance between phylogenetic trees
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Set relations and set systems induced by some families of integral domains
- Computational complexity of inferring phylogenies from dissimilarity matrices
- A canonical decomposition theory for metrics on a finite set
- Spanners of de Bruijn and Kautz graphs
- The complexity of reconstructing trees from qualitative characters and subtrees
- The dual complex of \({\overline{M}_{0,n}}\) via phylogenetics
- Patching up \(X\)-trees
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- Unique determination of some homoplasies at hybridization events
- Inferring evolutionary trees with strong combinatorial evidence
- A few logs suffice to build (almost) all trees. II
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Drawing polytopal graphs with {\texttt{polymake}}
- On the consistency of the minimum evolution principle of phylogenetic inference
- A fixed-parameter algorithm for minimum quartet inconsistency
- On the facets of the secondary polytope
- Non-hereditary maximum parsimony trees
- Spectral analysis and a closest tree method for genetic sequences
- NP-completeness of minimum spanner problems
- Tree spanners of bounded degree graphs
- Quartets in maximal weakly compatible split systems
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Distance measures in terms of substitution processes
- On sparse spanners of weighted graphs
- Tree spanners on chordal graphs: complexity and algorithms
- What can and what cannot be inferred from pairwise sequence comparisons?
- Characterizing weak compatibility in terms of weighted quartets
- Encoding phylogenetic trees in terms of weighted quartets
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Convex tree realizations of partitions
- Retractions of finite distance functions onto tree metrics
- An improved bound on the maximum agreement subtree problem
- Restrictions of minimum spanner problems
- Reconstructing phylogenetic trees from multipartite quartet systems
- Reconstructing a phylogenetic level-1 network from quartets
- Tree representations of non-symmetric group-valued proximities
- A property tester for tree-likeness of quartet topologies
- Quartet
- Trees, taxonomy, and strongly compatible multi-state characters
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
- Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent
- Patchworks
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Split decomposition over an Abelian group. I: Generalities
- Binary trees for dissimilarity data
- Recovering a tree from the leaf colourations it generates under a Markov model
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- A note on maximal hierarchies
- Representations of graphs and networks (coding, layouts and embeddings)
- Testing consistency of quartet topologies: a parameterized approach
- Injectivity and weak ternary separation
- Quarnet inference rules for level-1 networks
- Recovering hierarchies in terms of content similarity
- Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss
- Likelihood-mapping: A simple method to visualize phylogenetic content of a sequence alignment
- Inducibility in binary trees and crossings in random tanglegrams
- Polytopes with many splits and their secondary fans
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
- Network flow spanners
- Topology discovery of sparse random graphs with few participants
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- On the quartet distance given partial information
- Title not available (Why is that?)
- Title not available (Why is that?)
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction.
- A high quartet distance construction
This page was built for publication: Reconstructing the shape of a tree from observed dissimilarity data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q103560)
