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...

Full beskrivning

Sparad:
Bibliografiska uppgifter
I publikationen:J Comput Biol
Huvudupphovsmän: Carmel, Amir, Musa-Lempel, Noa, Tsur, Dekel, Ziv-Ukelson, Michal
Materialtyp: Artigo
Språk:Inglês
Publicerad: Mary Ann Liebert, Inc. 2014
Ämnen:
Research Articles
Länkar: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
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk