Caricamento...
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
BACKGROUND: The Maximal Pairing Problem (MPP) is the prototype of a class of combinatorial optimization problems that are of considerable interest in bioinformatics: Given an arbitrary phylogenetic tree T and weights ω(xy )for the paths between any two pairs of leaves (x, y), what is the collection...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
BioMed Central
2010
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2902485/ https://ncbi.nlm.nih.gov/pubmed/20525185 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1748-7188-5-25 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|