Search: onr:"swepub:oai:DiVA.org:kth-22853" >
A polynomial-time a...
A polynomial-time algorithm for near-perfect phylogeny
-
Fernandez-Baca, D. (author)
-
- Lagergren, Jens (author)
- KTH,Numerisk analys och datalogi, NADA
-
(creator_code:org_t)
- Society for Industrial & Applied Mathematics (SIAM), 2003
- 2003
- English.
-
In: SIAM journal on computing (Print). - : Society for Industrial & Applied Mathematics (SIAM). - 0097-5397 .- 1095-7111. ; 32:5, s. 1115-1127
- Related links:
-
http://www.cs.techni...
-
show more...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from perfection. This problem is shown to be solvable in polynomial time for any fixed value of the parameter.
Keyword
- algorithms
- computational biology
- character-based methods
- evolutionary trees
- parsimony
- perfect phylogeny
- phylogeny
- Steiner tree
- complexity
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database