A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hardness and Approximation of the Asynchronous Border Minimization Problem
[chapter]

2012
*
Lecture Notes in Computer Science
*

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 simply to find the embedding. Approximation algorithms have been proposed for the problem [21] but it is unknown whether the problem is

doi:10.1007/978-3-642-29952-0_20
fatcat:akrmp4fo3zhpjnbjdboide7uua