Abstract | ||
---|---|---|
Primer Approximation Multiplex PCR (PAMP) is a recently introduced experimental technique for detecting large-scale cancer genome lesions such as inversions and deletions from heterogeneous sam- ples containing a mixture of cancer and normal cells. In this paper we give integer linear program- ming formulations for the problem of selecting sets of PAMP primers that minimize detection failure probability. We also show that PAMP primer selection for detection of anchored deletions cannot be approximated within a factor of 2 ", and give a 2-approximation algorithm for a special case of the problem. Experimental results show that our ILP formulations can be used to optimally solve medium size instances of the inversion detection problem, and that heuristics based on iteratively solving ILP formulations for a one-sided version of the problem give near-optimal solutions for anchored deletion detection with highly scalable runtime. |
Year | Venue | Keywords |
---|---|---|
2008 | APBC | integer linear program- ming.,pamp primer selection,genomic structural variation detection,integer linear programming,multiplex pcr |
Field | DocType | Citations |
Genome,Multiplex polymerase chain reaction,Biology,Integer programming,Heuristics,Primer (molecular biology),Bioinformatics | Conference | 1 |
PageRank | References | Authors |
0.40 | 2 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bhaskar DasGupta | 1 | 551 | 70.14 |
Jin Jun | 2 | 2 | 4.82 |
Ion I. Mandoiu | 3 | 372 | 47.28 |