Recovering normal networks from shortest inter-taxa distance information (Q667692)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recovering normal networks from shortest inter-taxa distance information |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recovering normal networks from shortest inter-taxa distance information |
scientific article |
Statements
Recovering normal networks from shortest inter-taxa distance information (English)
0 references
1 March 2019
0 references
distance matrix
0 references
tree-child network
0 references
normal network
0 references
0 references
0.8648391962051392
0 references
0.854079008102417
0 references
0.8204780220985413
0 references
0.8197910785675049
0 references
