In order to accurately measure the gene expression levels in microarray experiments, it is crucial to design unique, highly specific and highly sensitive oligonucleotide probes for the identification of biological agents such as genes in a sample. Unique probes are difficult to obtain for closely related genes such as the known strains of HIV genes. The non-unique probe selection problem is to find one of the smallest probe set that is able to uniquely identify targets in a biological sample. This is an NP-hard problem. We present heuristic for finding near-minimal non-unique probe sets. Our method is a variant of the sequential forward selection algorithm, which used for feature subset selection in pattern recognition systems. The heuristic is guided by a probe set selection criterion which evaluates the efficiency and the effectiveness of a probe set in classifying targets genes as present or absent in a biological sample. Our methods outperformed all currently published greedy algorithms for this problem. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Wang, L., Ngom, A., & Rueda, L. (2008). Sequential forward selection approach to the non-unique oligonucleotide probe selection problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5265 LNBI, pp. 262–275). Springer Verlag. https://doi.org/10.1007/978-3-540-88436-1_23
Mendeley helps you to discover research relevant for your work.