Solving the tree containment problem for reticulation-visible networks in linear time (Q1660112)
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: Solving the tree containment problem for reticulation-visible networks in linear time |
scientific article; zbMATH DE number 6918639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the tree containment problem for reticulation-visible networks in linear time |
scientific article; zbMATH DE number 6918639 |
Statements
Solving the tree containment problem for reticulation-visible networks in linear time (English)
0 references
15 August 2018
0 references
phylogeny reconstruction
0 references
tree containment problem
0 references
reticulation-visible
0 references
0.877990186214447
0 references
0.8767806887626648
0 references
0.8734575510025024
0 references
0.8486453294754028
0 references
0.8406388759613037
0 references
