Fixed Topology Alignment with Recombination


In this paper, we study a new version of multiple sequence alignment, xed topology alignment with recombination. We show that it can not be approximated within any constant ratio unless P = NP. For a more restricted version, we show that the problem is MAX-SNP-hard. This implies that there is no PTAS for this version unless P = NP. We also propose… (More)
DOI: 10.1007/BFb0030789


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics