On the longest path algorithm for reconstructing trees from distance matrices (Q845904): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A fast algorithm for constructing trees from distance matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm to reconstruct trees from additive distance data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Determining the Evolutionary Tree Using Experiments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4535015 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471327 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the longest path algorithm for reconstructing trees from distance matrices |
scientific article |
Statements
On the longest path algorithm for reconstructing trees from distance matrices (English)
0 references
29 January 2010
0 references
analysis of algorithms
0 references
graph algorithms
0 references
