More Efficient Algorithms for Closest String and Substring Problems. Ma, B. & Sun, X. In Proc. of Research in Computational Molecular Biology (RECOMB 2008), volume 4955, of Lect Notes Comput Sci, pages 396–409, 2008.
abstract   bibtex   
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been extensively studied recently in computational biology. Unfortunately both problems are NP-complete. Researchers have developed both fixed-parameter algorithms and approximation algorithms for the two problems.
@InProceedings{ma08more,
  author    = {Bin Ma and Xiaoming Sun},
  title     = {More Efficient Algorithms for Closest String and Substring Problems},
  booktitle = {Proc. of Research in Computational Molecular Biology (RECOMB 2008)},
  year      = {2008},
  volume    = {4955},
  series    = lncs,
  pages     = {396--409},
  publisher = Springer,
  abstract  = {The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been extensively studied recently in computational biology. Unfortunately both problems are NP-complete. Researchers have developed both fixed-parameter algorithms and approximation algorithms for the two problems.},
  file      = {MaSun_MoreEfficientAlgorithms_RECOMB_2008.pdf:2008/MaSun_MoreEfficientAlgorithms_RECOMB_2008.pdf:PDF},
  keywords  = {closest string, closest substring, fpt, gene clusters},
  owner     = {Sebastian},
  timestamp = {2009.03.09},
}

Downloads: 0