onr:"swepub:oai:DiVA.org:kth-22853"
Search: onr:"swepub:oai:DiVA.org:kth-22853" > A polynomial-time a...
- 1 of 1
- Previous record
- Next record
- To hitlist
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
- Journal article (peer-reviewed)
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
- SIAM journal on computing (Print) (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Fernandez-Baca, ...
- Lagergren, Jens
- Articles in the publication
- SIAM journal on ...
- By the university
- Royal Institute of Technology
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
