Title of article
Integer linear programming approaches for non-unique probe selection Original Research Article
Author/Authors
Gunnar W. Klau، نويسنده , , Sven Rahmann، نويسنده , , Alexander Schliep، نويسنده , , Martin Vingron، نويسنده , , Knut Reinert، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
17
From page
840
To page
856
Abstract
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their ability to assess the presence or absence of biological agents, the targets, in a sample. Given a collection of genetic sequences of targets one faces the challenge of finding short oligonucleotides, the probes, which allow detection of targets in a sample by hybridization experiments. The experiments are conducted using either unique or non-unique probes, and the problem at hand is to compute a minimal design, i.e., a minimal set of probes that allows to infer the targets in the sample from the hybridization results. If we allow to test for more than one target in the sample, the design of the probe set becomes difficult in the case of non-unique probes.
Keywords
Integer linear programming , Probe , Microarray , Oligonucleotide , design , Group testing
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886467
Link To Document