Computing bounded-degree phylogenetic roots of disconnected graphs (Q5478010): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2004.12.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091622619 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:56, 19 March 2024
scientific article; zbMATH DE number 5037274
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing bounded-degree phylogenetic roots of disconnected graphs |
scientific article; zbMATH DE number 5037274 |
Statements
Computing bounded-degree phylogenetic roots of disconnected graphs (English)
0 references
30 June 2006
0 references
phylogeny
0 references
phylogenetic root
0 references
computational biology
0 references
graph power
0 references
tree power
0 references
graph algorithm
0 references
