A Simple Approximationalgorithm Fornonoverlapping Local Alignments ( Weighted Independent Sets of Axis Parallel Rectangles )

@inproceedings{Berman2002ASA,
  title={A Simple Approximationalgorithm Fornonoverlapping Local Alignments ( Weighted Independent Sets of Axis Parallel Rectangles )},
  author={Piotr Berman and Bhaskar DasGupta},
  year={2002}
}
We consider the following problem motivated by applications to nonoverlapping local alignment problems in computational molecular biology: we are a given a set of n positively weighted axis parallel rectangles such that, for each axis, the projection of a rectangle on this axis does not enclose that of another, and our goal is to select a subset of independent rectangles from the given set of rectangles of total maximum weight, where two rectangles are independent provided for each axis, the… CONTINUE READING