A decomposition theorem and two algorithms for reticulation-visible networks (Q729819): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2016.11.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2016.11.001 / rank | |||
Normal rank | |||
Latest revision as of 03:17, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition theorem and two algorithms for reticulation-visible networks |
scientific article |
Statements
A decomposition theorem and two algorithms for reticulation-visible networks (English)
0 references
22 December 2016
0 references
phylogenetic networks
0 references
reticulation-visibility
0 references
tree containment problem
0 references
cluster containment problem
0 references
galled networks
0 references
