Journal Article

·2014

Space pruning monotonic search for the non-unique probe selection problem

Elisa Pappalardo , Beyza Ahlatcıoğlu Özkök YTU , Pãnos M. Pardalos

International Journal of Bioinformatics Research and Applications

Abstract

Identification of targets, generally viruses or bacteria, in a biological sample is a relevant problem in medicine. Biologists can use hybridisation experiments to determine whether a specific DNA fragment, that represents the virus, is presented in a DNA solution. A probe is a segment of DNA or RNA, labelled with a radioactive isotope, dye or enzyme, used to find a specific target sequence on a DNA molecule by hybridisation. Selecting unique probes through hybridisation experiments is a difficult task, especially when targets have a high degree of similarity, for instance in a case of closely related viruses. After preliminary experiments, performed by a canonical Monte Carlo method with Heuristic Reduction (MCHR), a new combinatorial optimisation approach, the Space Pruning Monotonic Search (SPMS) method, is introduced. The experiments show that SPMS provides high quality solutions and outperforms the current state-of-the-art algorithms.

Keywords

Pruning Computational biology Heuristic Computer science Identification (biology) Monotonic function DNA Artificial intelligence Reduction (mathematics) Pattern recognition (psychology) Algorithm Biological system Biology Mathematics Genetics

Subject Areas

Algorithms and Data Compression ·Artificial Intelligence ·Physical Sciences
Machine Learning and Algorithms ·Artificial Intelligence ·Physical Sciences
Advanced Image and Video Retrieval Techniques ·Computer Vision and Pattern Recognition ·Physical Sciences