Abstract
The selection of probe sets for hybridization experiments directly affects the efficiency and cost of the analysis. We propose the application of the Asynchronous Team (A-Team) technique to determine near-optimal probe sets. An A-Team is comprised of several different heuristic algorithms that communicate with each other via shared memories. The A-Team method has been applied successfully to several problems including the Set Covering Problem, the Traveling Salesman Problem, and the Point-to-Point Connection Problem, and lends itself well to the Probe Selection Problem. We designed and developed a C + + program to run instances of the Minimum Cost Probe Set and Maximum Distinguishing Probe Set problems. A program description and our results are presented in the paper.
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.
