Hardness and Approximation of The Asynchronous Border Minimization Problem

Abstract

We study a combinatorial problem arising from the microarrays synthesis. The objective of the BMP is to place a set of sequences in the array and to find an embedding of these sequences into a common supersequence such that the sum of the “border length” is minimized. A variant of the problem, called P-BMP, is that the placement is given and the concern is… (More)

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Popa2012HardnessAA, title={Hardness and Approximation of The Asynchronous Border Minimization Problem}, author={Alexandru Popa and Prudence W. H. Wong and Fencol C. C. Yung}, year={2012} }