Bioinformatics Preprint 04-020
Download:
Titel:
Detecting Phylogenetic Footprint Clusters by Optimizing Barbeques
Author(s):
Axel Mosig,
Türker Biyikoglu,
Sonja J. Prohaska,
Peter F. Stadler
Submitted for publication
Abstract:
Taking a geometric view on a problem
occurring in the context of phylogenetic footprinting, we study the
so-called Best Barbeque Problem. The Best Barbeque Problem asks
for simultaneously stabbing a maximum number of differently colored
intervals from $K$ arrangements of colored intervals. This geometric
problem leads to a combinatorial optimization problem, a decision
version of which is shown to be NP-complete. Due to its relevance in
biological applications, we propose two branch-and-bound algorithms to
detect footprint clusters in some real world instances of phylogenetic
footprints. Finally, we point out other geometric and combinatorial
scenarios where optimizing barbeques might be of practical relevance.
Return to 2004 working papers list.
Last modified: 2004-03-28 19:56:33 studla