TARGETING 1.0 – Solver for the Maximal Pairing Problem on Arbitrary Trees

TARGETING 1.0

:: DESCRIPTION

TARGETING  is an efficient solver for the Maximal Pairing Problem on arbitrary trees.The algorithms introduced here make it possible to solve the MPP also for large trees with high-degree vertices. This has practical relevance in the field of comparative phylogenetics and, for example, in the context of phylogenetic targeting, i.e., data collection with resource limitations.

Advertisement

::DEVELOPER

Bioinformatics Leipzig

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

 TARGETING

:: MORE INFORMATION

Citation

Arnold, C. and Stadler, PF. 2010.
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees.
Algorithms for Molecular Biology.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.