Loading...
The Worst Case Complexity of Maximum Parsimony
One of the core classical problems in computational biology is that of constructing the most parsimonious phylogenetic tree interpreting an input set of sequences from the genomes of evolutionarily related organisms. We reexamine the classical maximum parsimony (MP) optimization problem for the gene...
Na minha lista:
| Udgivet i: | J Comput Biol |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Mary Ann Liebert, Inc.
2014
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4224053/ https://ncbi.nlm.nih.gov/pubmed/25302568 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1089/cmb.2014.0128 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|