Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
<p>Abstract</p> <p>Background</p> <p>The <it>Maximal Pairing Problem </it>(MPP) is the prototype of a class of combinatorial optimization problems that are of considerable interest in bioinformatics: Given an arbitrary phylogenetic tree <it>T </it&g...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2010-06-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/5/1/25 |