@InProceedings{wang09efficient,
  author    = {Wang, Lusheng and Zhu, Binhai},
  title     = {Efficient Algorithms for the Closest String and Distinguishing String Selection Problems},
  booktitle = {Proc. of Frontiers in Algorithmics Workshop (FAW 2009)},
  year      = {2009},
  volume    = {5598},
  series    = lncs,
  pages     = {261--270},
  publisher = Springer,
  abstract  = {In the paper, we study three related problems, the closest string problem, the farthest string problem and the distinguishing string selection problem. These problems have applications in motif detection, binding sites locating, genetic drug target identification, genetic probes design, universal PCR primer design, etc. They have been extensively studied in recent years.},
  doi       = {10.1007/978-3-642-02270-8_27},
  keywords  = {fpt, center string, closest string, closest substring},
  owner     = {Sebastian},
  timestamp = {2010.04.18},
}

{"_id":"JhRurc3AiBXYmf572","bibbaseid":"wang-zhu-efficientalgorithmsforthecloseststringanddistinguishingstringselectionproblems-2009","authorIDs":[],"author_short":["Wang, L.","Zhu, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Wang"],"firstnames":["Lusheng"],"suffixes":[]},{"propositions":[],"lastnames":["Zhu"],"firstnames":["Binhai"],"suffixes":[]}],"title":"Efficient Algorithms for the Closest String and Distinguishing String Selection Problems","booktitle":"Proc. of Frontiers in Algorithmics Workshop (FAW 2009)","year":"2009","volume":"5598","series":"Lect Notes Comput Sci","pages":"261–270","publisher":"Springer, Berlin","abstract":"In the paper, we study three related problems, the closest string problem, the farthest string problem and the distinguishing string selection problem. These problems have applications in motif detection, binding sites locating, genetic drug target identification, genetic probes design, universal PCR primer design, etc. They have been extensively studied in recent years.","doi":"10.1007/978-3-642-02270-8_27","keywords":"fpt, center string, closest string, closest substring","owner":"Sebastian","timestamp":"2010.04.18","bibtex":"@InProceedings{wang09efficient,\n author = {Wang, Lusheng and Zhu, Binhai},\n title = {Efficient Algorithms for the Closest String and Distinguishing String Selection Problems},\n booktitle = {Proc. of Frontiers in Algorithmics Workshop (FAW 2009)},\n year = {2009},\n volume = {5598},\n series = lncs,\n pages = {261--270},\n publisher = Springer,\n abstract = {In the paper, we study three related problems, the closest string problem, the farthest string problem and the distinguishing string selection problem. These problems have applications in motif detection, binding sites locating, genetic drug target identification, genetic probes design, universal PCR primer design, etc. They have been extensively studied in recent years.},\n doi = {10.1007/978-3-642-02270-8_27},\n keywords = {fpt, center string, closest string, closest substring},\n owner = {Sebastian},\n timestamp = {2010.04.18},\n}\n\n","author_short":["Wang, L.","Zhu, B."],"key":"wang09efficient","id":"wang09efficient","bibbaseid":"wang-zhu-efficientalgorithmsforthecloseststringanddistinguishingstringselectionproblems-2009","role":"author","urls":{},"keyword":["fpt","center string","closest string","closest substring"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.801Z","downloads":0,"keywords":["fpt","center string","closest string","closest substring"],"search_terms":["efficient","algorithms","closest","string","distinguishing","string","selection","problems","wang","zhu"],"title":"Efficient Algorithms for the Closest String and Distinguishing String Selection Problems","year":2009,"dataSources":["C5FtkvWWggFfMJTFX"]}