A decomposition theorem and two algorithms for reticulation-visible networks (Q729819): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2016.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2548296792 / rank | |||
Normal rank | |||
Revision as of 01:15, 20 March 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
