Computing Phylogenetic Roots with Bounded Degrees and Errors (Q4706236): 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: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539701389154 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039104371 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:49, 30 July 2024
scientific article; zbMATH DE number 1931314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Phylogenetic Roots with Bounded Degrees and Errors |
scientific article; zbMATH DE number 1931314 |
Statements
Computing Phylogenetic Roots with Bounded Degrees and Errors (English)
0 references
19 June 2003
0 references
phylogeny
0 references
phylogenetic root
0 references
computational biology
0 references
efficient algorithm
0 references
NP-hard
0 references
