Pages that link to "Item:Q103560"
From MaRDI portal
The following pages link to Reconstructing the shape of a tree from observed dissimilarity data (Q103560):
Displayed 39 items.
- Quartet (Q103568) (← links)
- Analytic solutions for three taxon ML trees with variable rates across sites (Q876473) (← links)
- Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces (Q1056946) (← links)
- Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978) (← links)
- Parsimonious phylogenetic trees in metric spaces and simulated annealing (Q1099115) (← links)
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency. (Q1126354) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A canonical decomposition theory for metrics on a finite set (Q1190163) (← links)
- Convex tree realizations of partitions (Q1195647) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- Spectral analysis and a closest tree method for genetic sequences (Q1206217) (← links)
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results (Q1281782) (← links)
- Retractions of finite distance functions onto tree metrics (Q1283796) (← links)
- Distance measures in terms of substitution processes (Q1289346) (← links)
- Patching up \(X\)-trees (Q1306736) (← links)
- What can and what cannot be inferred from pairwise sequence comparisons? (Q1307063) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Recovering a tree from the leaf colourations it generates under a Markov model (Q1324462) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- A phase transition for a random cluster model on phylogenetic trees. (Q1429803) (← links)
- Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction. (Q1566634) (← links)
- A note on maximal hierarchies (Q1570234) (← links)
- Inferring evolutionary trees with strong combinatorial evidence (Q1575435) (← links)
- On the consistency of the minimum evolution principle of phylogenetic inference (Q1868712) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- Tree representations of non-symmetric group-valued proximities (Q1970526) (← links)
- Unique determination of some homoplasies at hybridization events (Q2426327) (← links)
- A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance (Q2563540) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem (Q3503579) (← links)
- Likelihood-mapping: A simple method to visualize phylogenetic content of a sequence alignment (Q4350854) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- Patchworks (Q5927521) (← links)
- Analyzing and visualizing sequence and distance data using SPLITSTREE (Q5961620) (← links)