{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T11:13:15Z","timestamp":1711105995397},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,13]],"date-time":"2014-04-13T00:00:00Z","timestamp":1397347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11227-014-1180-3","type":"journal-article","created":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T02:30:45Z","timestamp":1397269845000},"page":"814-826","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallelizing exact motif finding algorithms on multi-core"],"prefix":"10.1007","volume":"69","author":[{"given":"Mostafa M.","family":"Abbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazem M.","family":"Bahig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Abouelhoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Mohie-Eldin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,13]]},"reference":[{"key":"1180_CR1","unstructured":"Pevzner P, Sze S (2000) Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of eighth international conference on intelligent systems for molecular biology, pp 269\u2013278"},{"issue":"2","key":"1180_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J Buhler","year":"2002","unstructured":"Buhler J, Tompa M (2002) Finding motifs using random projections. J Comput Biol 9(2):225\u2013242","journal-title":"J Comput Biol"},{"key":"1180_CR3","doi-asserted-by":"crossref","unstructured":"Leung H, Chin F (2005) Generalized planted $$(l, d)$$ ( l , d ) -motif problem with negative set. In: Proceedings of workshop on algorithms in bioinformatics (LNCS), vol 3692, pp 264\u2013275","DOI":"10.1007\/11557067_22"},{"issue":"1","key":"1180_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/prot.340070105","volume":"7","author":"C Lawrence","year":"1990","unstructured":"Lawrence C, Reilly A (1990) An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins Struct Funct Genet 7(1):41\u201351","journal-title":"Proteins Struct Funct Genet"},{"key":"1180_CR5","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 (1993) Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262:208\u2013214","journal-title":"Science"},{"key":"1180_CR6","first-page":"51","volume":"21","author":"T Bailey","year":"1995","unstructured":"Bailey T, Elkan C (1995) Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Mach Learn 21:51\u201380","journal-title":"Mach Learn"},{"key":"1180_CR7","doi-asserted-by":"crossref","unstructured":"Fraenkel Y, Mandel Y, Friedberg D, Margalit H (1995) Identification of common motifs in unaligned DNA sequences: application to $$Escherichia\\ coli$$ E s c h e r i c h i a c o l i Lrpregulon. Bioinformatics 11:379\u2013387","DOI":"10.1093\/bioinformatics\/11.4.379"},{"key":"1180_CR8","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 (1998) Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics 14:55\u201367","journal-title":"Bioinformatics"},{"key":"1180_CR9","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"G Hertz","year":"1999","unstructured":"Hertz G, Stormo G (1999) Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15:563\u2013577","journal-title":"Bioinformatics"},{"key":"1180_CR10","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1093\/nar\/28.3.695","volume":"28","author":"M Gelfand","year":"2000","unstructured":"Gelfand M, Koonin E, Mironov A (2000) Prediction of transcription regulatory sites in archaea by a comparative genomic approach. Nucl Acid Res 28:695\u2013705","journal-title":"Nucl Acid Res"},{"issue":"2","key":"1180_CR11","doi-asserted-by":"crossref","first-page":"ii149","DOI":"10.1093\/bioinformatics\/btg1072","volume":"19","author":"A Price","year":"2003","unstructured":"Price A, Ramabhadran S, Pevzner P (2003) Finding subtle motifs by branching from sample strings. Bioinformatics 19(2):ii149\u2013ii155","journal-title":"Bioinformatics"},{"issue":"4","key":"1180_CR12","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/TCBB.2010.92","volume":"8","author":"C Huang","year":"2011","unstructured":"Huang C, Lee W, Hsieh S (2011) An improved heuristic algorithm for finding motif signals in DNA sequences. IEEE\/ACM Trans Comput Biol Bioinf 8(4):959\u2013975","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"1180_CR13","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 (1985) Rigorous pattern-recognition methods for DNA sequences: analysis of promoter sequences from $$Escherichia coli$$ E s c h e r i c h i a c o l i . J Mol Biol 186(1):117\u2013128","journal-title":"J Mol Biol"},{"issue":"4","key":"1180_CR14","first-page":"293","volume":"5","author":"R Staden","year":"1989","unstructured":"Staden R (1989) Methods for discovering novel motifs in nucleic acid sequences. Comput Appl Biosci 5(4):293\u2013298","journal-title":"Comput Appl Biosci"},{"key":"1180_CR15","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 (1998) Predicting gene regulatory elements in silico on a genomic scale. Genome Res 15:1202\u20131215","journal-title":"Genome Res"},{"key":"1180_CR16","doi-asserted-by":"crossref","unstructured":"Sagot M (1998) Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi CL, Moura AV (eds) Latin\u201998: theoretical informatics, LNCS, vol 1380, pp 111\u2013127","DOI":"10.1007\/BFb0054337"},{"issue":"5","key":"1180_CR17","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1006\/jmbi.1998.1947","volume":"281","author":"J Van-Helden","year":"1998","unstructured":"Van-Helden J, Andre B, Collado-Vides J (1998) Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J Mol Biol 281(5):827\u2013842","journal-title":"J Mol Biol"},{"key":"1180_CR18","unstructured":"Tompa M (1999) An exact method for finding short motifs in sequences with application to the ribosome binding site problem. In: Proceedings of seventh international conference on intelligent systems for molecular biology, pp 262\u2013271"},{"issue":"3\u20134","key":"1180_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L Marsan","year":"2000","unstructured":"Marsan L, Sagot M (2000) Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J Comput Biol 7(3\u20134):345\u2013362","journal-title":"J Comput Biol"},{"key":"1180_CR20","unstructured":"Sinha S, Tompa M (2000) A statistical method for finding transcription factor binding sites. In: Proceedings of eighth international conference on intelligent systems for molecular biology, pp 344\u2013354"},{"issue":"2","key":"1180_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1089\/10665270252935421","volume":"9","author":"M Blanchette","year":"2002","unstructured":"Blanchette M, Schwikowski B, Tompa M (2002) Algorithms for phylogenetic footprinting. J Comput Biol 9(2):211\u2013223","journal-title":"J Comput Biol"},{"issue":"1","key":"1180_CR22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"18","author":"E Eskin","year":"2002","unstructured":"Eskin E, Pevzner P (2002) Finding composite regulatory patterns in DNA sequences. Bioinformatics 18(1):354\u2013363","journal-title":"Bioinformatics"},{"key":"1180_CR23","doi-asserted-by":"crossref","unstructured":"Evans P, Smith A (2003) Toward optimal motif enumeration. In: Proceedings of eighth international workshop algorithms and data structures ( WADS03), pp 47\u201358","DOI":"10.1007\/978-3-540-45078-8_5"},{"key":"1180_CR24","doi-asserted-by":"crossref","unstructured":"Carvalho A, Freitas A, Oliveira A, Sagot M (2005) A highly scalable algorithm for the extraction of CIS-Regulatory regions. In: Proceedings of third Asia Pacific bioinformatics conference, pp 273\u2013282","DOI":"10.1142\/9781860947322_0027"},{"key":"1180_CR25","doi-asserted-by":"crossref","unstructured":"Chin F, Leung H (2005) Voting algorithms for discovering long motifs. In: Proceedings of third Asia Pacific bioinformatics conference, pp 261\u2013271","DOI":"10.1142\/9781860947322_0026"},{"issue":"8","key":"1180_CR26","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 (2005) Exact algorithms for planted motif problems. J Comput Biol 12(8):1117\u20131128","journal-title":"J Comput Biol"},{"key":"1180_CR27","doi-asserted-by":"crossref","unstructured":"Davila J, Balla S, Rajasekaran S (2006) Space and time efficient algorithms for planted motif search. In: Proceedings of second international workshop on bioinformatics research and applications ( LNCS 3992), pp 822\u2013829","DOI":"10.1007\/11758525_110"},{"key":"1180_CR28","doi-asserted-by":"crossref","unstructured":"Pisanti N, Carvalho A, Marsan L, Sagot M (2006) RISOTTO: fast extraction of motifs with mismatches. In: Proceedings of seventh Latin American theoretical informatics symposium, pp 757\u2013768","DOI":"10.1007\/11682462_69"},{"issue":"4","key":"1180_CR29","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 (2007) Fast and practical algorithms for planted $$(l, d)$$ ( l , d ) motif search. IEEE\/ACM Trans Comput Biol Bioinf 4(4):544\u2013552","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"1180_CR30","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 (2011) PMS5: an efficient exact algorithm for the $$(l, d)$$ ( l , d ) -motif finding problem. BMC Bioinf 12:410\u2013420","journal-title":"BMC Bioinf"},{"key":"1180_CR31","doi-asserted-by":"crossref","unstructured":"Abbas M, Abouelhoda M, Bahig H (2012) A hybrid method for the exact planted (l, d) motif finding problem and its parallelization. BMC Bioinformatics, vol 13, supplement 17, Article S10","DOI":"10.1186\/1471-2105-13-S17-S10"},{"key":"1180_CR32","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay S, Sahni S, Rajasekaran S (2012) PMS6: a faster algorithm for motif discovery. In: Proceedings of the second IEEE international conference on computational advances in bio and medical sciences (ICCABS 2012), pp 1\u20136","DOI":"10.1109\/ICCABS.2012.6182627"},{"issue":"4","key":"1180_CR33","first-page":"303","volume":"12","author":"W Grundy","year":"1996","unstructured":"Grundy W, Bailey T, Elkan C (1996) ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Comput Appl Biosci 12(4):303\u2013310","journal-title":"Comput Appl Biosci"},{"key":"1180_CR34","doi-asserted-by":"crossref","unstructured":"Carvalho A, Freitas A, Oliveira A, Sagot M (2004) A parallel algorithm for the extraction of structured motifs. In: Proceedings of the 19th ACM symposium on applied computing (SAC\u201904), pp 147\u2013153","DOI":"10.1145\/967900.967932"},{"key":"1180_CR35","doi-asserted-by":"crossref","unstructured":"Hamdani H, Rashid N, Abdulrazzaq A, Ghadban R, Wajidi M (2009) Fast phylocon algorithm using OpenMP. In: Proceedings of the IEEE international conference on computer technology and development, pp 550\u2013553","DOI":"10.1109\/ICCTD.2009.198"},{"key":"1180_CR36","doi-asserted-by":"crossref","unstructured":"Yu L, Xu Y (2009) A parallel Gibbs sampling algorithm for motif finding on GPU. In: Proceedings of the IEEE international symposium on parallel and distributed processing with applications, pp 555\u2013558","DOI":"10.1109\/ISPA.2009.88"},{"key":"1180_CR37","unstructured":"Faheem H (2010) Accelerating motif finding problem using grid computing with enhanced brute force. In: Proceedings of the 12th international conference on advanced communication technology (ICACT), pp 197\u2013202"},{"key":"1180_CR38","doi-asserted-by":"crossref","unstructured":"Dasari N, Desh R, Zubair M (2010a) An efficient multicore implementation of planted motif problem. In: Proceedings of the international conference on high performance computing and simulation, pp 9\u201315","DOI":"10.1109\/HPCS.2010.5547161"},{"key":"1180_CR39","unstructured":"Dasari N, Desh R, Zubair M (2010b) Solving planted motif problem on GPU. In: International workshop on GPUs and scientific applications"},{"key":"1180_CR40","doi-asserted-by":"crossref","unstructured":"Dasari N, Desh R, Zubair M (2011) High performance implementation of planted motif problem using suffix trees. In: Proceedings of the international conference on high performance computing and simulation, pp 200\u2013206","DOI":"10.1109\/HPCSim.2011.5999825"},{"key":"1180_CR41","unstructured":"Sahoo B, Sourav R, Ranjan R, Padhy S (2011) Parallel implementation of exact algorithm for planted motif search problem using SMP cluster. Eur J Sci Res 64(4):484\u2013496"},{"key":"1180_CR42","doi-asserted-by":"crossref","unstructured":"Liu Y, Schmidt B, Maskell D (2011) An ultrafast scalable many-core motif discovery algorithm for multiple GPUs. In: Proceedings of the IEEE international parallel and distributed processing symposium, pp 423\u2013429","DOI":"10.1109\/IPDPS.2011.183"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1180-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1180-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1180-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T02:18:26Z","timestamp":1689128306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1180-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,13]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1180-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,13]]}}}