Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2010
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2902485/ https://www.ncbi.nlm.nih.gov/pubmed/20525185 http://dx.doi.org/10.1186/1748-7188-5-25 |