{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T17:06:10Z","timestamp":1724087170643},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T00:00:00Z","timestamp":1385078400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11786-013-0165-6","type":"journal-article","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T05:45:18Z","timestamp":1385012718000},"page":"387-399","source":"Crossref","is-referenced-by-count":9,"title":["An Efficient Algorithm to Identify DNA Motifs"],"prefix":"10.1007","volume":"7","author":[{"given":"Mostafa M.","family":"Abbass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazem M.","family":"Bahig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,22]]},"reference":[{"issue":"Suppl. 17","key":"165_CR1","doi-asserted-by":"crossref","first-page":"S10","DOI":"10.1186\/1471-2105-13-S17-S10","volume":"13","author":"M. Abbas","year":"2012","unstructured":"Abbas M., Abouelhoda M., Bahig H.: A hybrid method for the exact planted (l, d)-motif finding problem and its parallelization. BMC Bioinforma. 13(Suppl. 17), S10 (2012)","journal-title":"BMC Bioinforma."},{"key":"165_CR2","first-page":"51","volume":"21","author":"T. Bailey","year":"1995","unstructured":"Bailey T., Elkan C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Mach. Learn. 21, 51\u201380 (1995)","journal-title":"Mach. Learn."},{"key":"165_CR3","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay, S., Sahni, S., Rajasekaran, S.: PMS6: A faster algorithm for motif discovery. In: Proc. ICCABS 2012, pp. 1\u20136 (2012)","DOI":"10.1109\/ICCABS.2012.6182627"},{"key":"165_CR4","doi-asserted-by":"crossref","unstructured":"Blanchette, M.: Algorithms for phylogenetic footprinting. In: Proc. RECOMB\u201901, pp. 49\u201358 (2001)","DOI":"10.1145\/369133.369170"},{"issue":"5","key":"165_CR5","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1101\/gr.6902","volume":"12","author":"M. Blanchette","year":"2002","unstructured":"Blanchette M., Tompa M.: Discovery of regulatory elements by a computational method for phylogenetic footprinting. Genome Res. 12(5), 739\u2013748 (2002)","journal-title":"Genome Res."},{"key":"165_CR6","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1101\/gr.8.11.1202","volume":"15","author":"A. Brazma","year":"1998","unstructured":"Brazma A., Jonassen I., Vilo J., Ukkonen E.: Predicting gene regulatory elements in silico on a genomic scale. Genome Res. 15, 1202\u20131215 (1998)","journal-title":"Genome Res."},{"issue":"2","key":"165_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler J., Tompa M.: Finding motifs using random projections. J. Comput. Biol. 9(2), 225\u2013242 (2002)","journal-title":"J. Comput. Biol."},{"key":"165_CR8","doi-asserted-by":"crossref","unstructured":"Chin, F., Leung, H.: Voting algorithms for discovering long motifs. In: Proc. APBC 2005, pp. 261\u2013271 (2005)","DOI":"10.1142\/9781860947322_0026"},{"key":"165_CR9","doi-asserted-by":"crossref","unstructured":"Davila, J., Balla, S., Rajasekaran, S.: Space and time efficient algorithms for planted motif search. In: Proc. IWBRA 2006, LNCS 3992, pp. 822\u2013829 (2006)","DOI":"10.1007\/11758525_110"},{"issue":"4","key":"165_CR10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/TCBB.2007.70241","volume":"4","author":"J. Davila","year":"2007","unstructured":"Davila J., Balla S., Rajasekaran S.: Fast and practical algorithms for planted (l, d)-motif search. IEEE\/ACM Trans. Comput. Biol. Bioinforma. 4(4), 544\u2013552 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinforma."},{"key":"165_CR11","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1186\/1471-2105-12-410","volume":"12","author":"H. Dinh","year":"2011","unstructured":"Dinh H., Rajasekaran S., Kundeti V.: PMS5: an efficient exact algorithm for the (l, d)-motif finding problem. BMC Bioinforma. 12, 410\u2013420 (2011)","journal-title":"BMC Bioinforma."},{"issue":"1","key":"165_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0022-2836(85)90262-1","volume":"186","author":"D. Galas","year":"1985","unstructured":"Galas D., Eggert M., Waterman M.: Rigorous pattern-recognition methods for DNA sequences: analysis of promoter sequences from Escherichia coli. J. Mol. Biol. 186(1), 117\u2013128 (1985)","journal-title":"J. Mol. Biol."},{"key":"165_CR13","unstructured":"Hertz G., Stormo G.: Identification of consensus patterns in unaligned DNA and protein sequences: a large-deviation statistical basis for penalizing gaps. In: Lim, H., Cantor, C. (eds.) Bioinformatics and Genome Research, pp. 201\u2013216. World Scientific, Singapore (1995)"},{"key":"165_CR14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C. Lawrence","year":"1993","unstructured":"Lawrence C., Altschul S., Boguski M., Liu J., Neuwald A., Wootton J.: Detecting subtule sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262, 208\u2013214 (1993)","journal-title":"Science"},{"key":"165_CR15","doi-asserted-by":"crossref","unstructured":"Leung, H., Chin, F.: Finding exact optimal motif in matrix representation by partitioning. Bioinformatics 21(Supp. 2), ii-86\u2013ii92 (2005)","DOI":"10.1093\/bioinformatics\/bti1115"},{"key":"165_CR16","doi-asserted-by":"crossref","unstructured":"Ono, H., Ng, Y.: Best fiting-length substring patterns for a set of string. In: Proc. COCOON 2005, LNCS 3595, pp. 240\u2013250 (2005)","DOI":"10.1007\/11533719_26"},{"key":"165_CR17","unstructured":"Pevzner, P., Sze, S.H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. ISMB 2000. The AAAI Press, Menlo Park, pp. 269\u2013278 (2000)"},{"key":"165_CR18","doi-asserted-by":"crossref","unstructured":"Rajasekaran S.: Algorithms for motif search. In: Aluru, S. (ed.) Handbook of Computational Molecular Biology, pp. 37-1\u201337-21. Chapman and Hall\/CRC, London (2006)","DOI":"10.1201\/9781420036275.ch37"},{"issue":"8","key":"165_CR19","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1089\/cmb.2005.12.1117","volume":"12","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran S., Balla S., Huang C.-H.: Exact algorithms for planted motif problems. J. Comput. Biol. 12(8), 1117\u20131128 (2005)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"165_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"I. Rigoutsos","year":"1998","unstructured":"Rigoutsos I., Floratos A.: Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics 14(1), 55\u201367 (1998)","journal-title":"Bioinformatics"},{"key":"165_CR21","doi-asserted-by":"crossref","unstructured":"Sagot, M.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, L., Moura, A. (eds.), Proc. Latin\u201998, LNCS 1380, pp 111\u2013127 (1998)","DOI":"10.1007\/BFb0054337"},{"key":"165_CR22","unstructured":"Sinha, S., Tompa, M.: A statistical method for finding transcription factor binding sites. In: Proc. ISMB 2000. The AAAI Press, Menlo Park, pp. 344\u2013354 (2000)"},{"key":"165_CR23","unstructured":"Tompa, M.: An exact method for finding short motifs in sequences with application to the ribosome binding site problem. In: Proc. ISMB 1999. The AAAI Press, Menlo Park, pp. 262\u2013271 (1999)"},{"issue":"1","key":"165_CR24","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1093\/nar\/24.1.238","volume":"24","author":"E. Wingender","year":"1996","unstructured":"Wingender E., Dietze P., Karas H., Knppel R.: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Res. 24(1), 238\u2013241 (1996)","journal-title":"Nucleic Acids Res."},{"issue":"7\u20138","key":"165_CR25","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1093\/bioinformatics\/15.7.607","volume":"15","author":"J. Zhu","year":"1999","unstructured":"Zhu J., Zhang M.: SCPD: a promoter database of the yeast Saccharomyces cerevisiae. Bioinformatics 15(7\u20138), 607\u2013611 (1999)","journal-title":"Bioinformatics"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-013-0165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-013-0165-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-013-0165-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T18:03:34Z","timestamp":1564855414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-013-0165-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,22]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s11786-013-0165-6","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,22]]}}}