Abstract
Identification of biological agents in a sample is a relevant problem in medicine. A model to this problem consists of selecting optimal oligonucleotide probe sets for use in hybridization experiments in which target viruses or bacteria are to be identified in biological samples. In such an experiment the presence or absence of these targets is determined by observing whether selected probes bind to their corresponding sequences. The problem is to select a probe set that is able to uniquely identify targets while containing a minimal number of probes. In this paper we describe a heuristic algorithm that produced feasible solution sets that for large, real data sets contain significantly fewer probes than those obtained using other methods. A description of the problem, our approach, and the results are presented. We developed a C++ program and a GUI (Graphical User Interface) to run real and simulated instances of the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
