On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Low dimensional embeddings of ultrametrics. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational complexity of inferring phylogenies from dissimilarity matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A few logs suffice to build (almost) all trees (I) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A few logs suffice to build (almost) all trees. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A robust model for finding optimal evolutionary tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of ultrametric partitions on graphs / rank | |||
Normal rank | |||
Revision as of 14:44, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of inferring phylogenies from triplet-dissimilarities |
scientific article |
Statements
On the hardness of inferring phylogenies from triplet-dissimilarities (English)
0 references
7 January 2008
0 references
NP hardness
0 references
hardness of approximation
0 references
phylogenetic trees
0 references
distance based reconstruction algorithms
0 references
