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):
Displaying 50 items.
- Quartet (Q103568) (← links)
- Minimum tree cost quartet puzzling (Q263274) (← links)
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- The dual complex of \({\overline{M}_{0,n}}\) via phylogenetics (Q292080) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Non-hereditary maximum parsimony trees (Q455749) (← links)
- Reconstructing a phylogenetic level-1 network from quartets (Q486621) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Drawing polytopal graphs with {\texttt{polymake}} (Q600948) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- On the facets of the secondary polytope (Q618300) (← links)
- A property tester for tree-likeness of quartet topologies (Q649111) (← links)
- Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent (Q658995) (← links)
- Split decomposition over an Abelian group. I: Generalities (Q659783) (← links)
- Quartets in maximal weakly compatible split systems (Q735131) (← links)
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves (Q743846) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors (Q845860) (← links)
- Analytic solutions for three taxon ML trees with variable rates across sites (Q876473) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
- Characterizing weak compatibility in terms of weighted quartets (Q1012157) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- An improved bound on the maximum agreement subtree problem (Q1036838) (← 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)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Polytopes with many splits and their secondary fans (Q1759316) (← links)
