Constructing big trees from short sequences (Q4572010): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4875208 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4866243 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228475 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The probabilities of rooted tree-shapes generated by random bifurcation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank | |||
Normal rank | |||
Latest revision as of 02:30, 16 July 2024
scientific article; zbMATH DE number 6898433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing big trees from short sequences |
scientific article; zbMATH DE number 6898433 |
Statements
Constructing big trees from short sequences (English)
0 references
4 July 2018
0 references
short quartets method
0 references
\(L_\infty\)-nearest tree problem
0 references
