{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:40:20Z","timestamp":1654112420457},"reference-count":26,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>Motif identification for DNA sequences has many important applications in biological studies, including diagnostic probe design, locating binding sites and regulatory signals, and potential drug target identification. There are two versions\u2014the Single Group and Two Groups. Here, the occurrences of the motif in the given sequences have errors. Currently, most of existing programs can only handle the case of single group. However, most of the programs do not allow indels (insertions and deletions) in the occurrences of the motif. In this paper, the authors propose a randomized algorithm for the one group problem that can handle indels in the occurrences of the motif. Finally, an algorithm for the two groups\u2019 problem is given along with extensive simulations evaluating algorithms.<\/p>","DOI":"10.4018\/jkdb.2010070104","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T20:20:07Z","timestamp":1297801207000},"page":"53-67","source":"Crossref","is-referenced-by-count":0,"title":["Identification of Distinguishing Motifs"],"prefix":"10.4018","volume":"1","author":[{"given":"Wangsen","family":"Feng","sequence":"first","affiliation":[{"name":"Peking University, China"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, China"}]}],"member":"2432","reference":[{"key":"jkdb.2010070104-0","unstructured":"Bailey, T., & Elkan, C. (1994). Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB-94) (pp. 28-36). Menlo Park, CA: AAAI Press."},{"key":"jkdb.2010070104-1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993379"},{"key":"jkdb.2010070104-2","doi-asserted-by":"crossref","unstructured":"Blanchette, M. (2001). Algorithms for phylogenetic footprinting. In Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB 01) (pp. 49-58).","DOI":"10.1145\/369133.369170"},{"key":"jkdb.2010070104-3","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935430"},{"key":"jkdb.2010070104-4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701397825"},{"key":"jkdb.2010070104-5","first-page":"123","article-title":"Design of primers for PCR amplification of highly variable genomes.","volume":"9","author":"J.Dopazo","year":"1993","journal-title":"CABIOS"},{"key":"jkdb.2010070104-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-440X(97)80058-9"},{"key":"jkdb.2010070104-7","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/21.10.2315"},{"key":"jkdb.2010070104-8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"jkdb.2010070104-9","unstructured":"Hertz, G., & Stormo, G. (1995). Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps. In Proceedings of the 3rd Int\u2019l Conf. Bioinformatics and Genome Research (pp. 201-216)."},{"key":"jkdb.2010070104-10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.10.1374"},{"key":"jkdb.2010070104-11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.10.1382"},{"key":"jkdb.2010070104-12","first-page":"12","author":"G. H.Keller","year":"1989","journal-title":"DNA Probes"},{"key":"jkdb.2010070104-13","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., & Zhang, L. (1999). Distinguishing string selection problems. In Proceedings of the 10th ACM-SIAM Symp. on Discrete Algorithms (pp. 633-642)."},{"key":"jkdb.2010070104-14","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340070105"},{"key":"jkdb.2010070104-15","doi-asserted-by":"crossref","unstructured":"Li, M., Ma, B., & Wang, L. (1999). Finding Similar Regions in Many Strings. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, Atlanta (pp. 473-482).","DOI":"10.1145\/301250.301376"},{"key":"jkdb.2010070104-16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1823"},{"key":"jkdb.2010070104-17","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506150"},{"key":"jkdb.2010070104-18","first-page":"525","article-title":"An improved microcom-puter program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes.","volume":"7","author":"K.Lucas","year":"1991","journal-title":"CABIOS"},{"key":"jkdb.2010070104-19","first-page":"8","author":"M. J.McPearson","year":"1991","journal-title":"PCR A Practical Approach"},{"key":"jkdb.2010070104-20","unstructured":"Pevzner, P., & Sze, S. (2000). Combinatorial approaches to finding subtle signals in DNA sequences. In Proceedings of the 8th International Conference on Intelligent Sys-tems for Molecular Biology (pp. 269-278)."},{"key":"jkdb.2010070104-21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1072"},{"key":"jkdb.2010070104-22","first-page":"253","article-title":"Primer Master: a new program for the design and analysis of PCR primers.","volume":"12","author":"V.Proutski","year":"1996","journal-title":"CABIOS"},{"key":"jkdb.2010070104-23","first-page":"211","article-title":"Consensus patterns in DNA","volume":"Vol. 183","author":"G.Stormo","year":"1990","journal-title":"Molecular evolution: computer analysis of protein and nucleic acid sequences"},{"key":"jkdb.2010070104-24","doi-asserted-by":"crossref","unstructured":"Wang, L., Dong, L., & Fan, H. (2004). Randomized Algorithms for Motif Detection. In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC\u201904) (pp. 884-895).","DOI":"10.1007\/978-3-540-30551-4_75"},{"key":"jkdb.2010070104-25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0092-8240(84)80056-7","article-title":"Pattern recognition in several sequences: consenus and alignment.","volume":"46","author":"M.Waterman","year":"1984","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["International Journal of Knowledge Discovery in Bioinformatics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=47096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:19:26Z","timestamp":1654111166000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jkdb.2010070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jkdb.2010070104","relation":{},"ISSN":["1947-9115","1947-9123"],"issn-type":[{"value":"1947-9115","type":"print"},{"value":"1947-9123","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}