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

Int J Bioinform Res Appl. 2014;10(1):59-74. doi: 10.1504/IJBRA.2014.058778.

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: DNA fragments; DNA molecules; Monte Carlo algorithm; bacteria; bioinformatics; discrete optimisation; hybrid method; hybridisation; microarrays; probe selection; space pruning monotonic search; target identification; target sequences; viruses.

MeSH terms

  • Algorithms*
  • Base Sequence
  • DNA Probes / genetics*
  • DNA, Viral / genetics*
  • Data Interpretation, Statistical*
  • In Situ Hybridization / methods*
  • Molecular Sequence Data
  • Sequence Analysis, DNA / methods*

Substances

  • DNA Probes
  • DNA, Viral