{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:16:35Z","timestamp":1783984595145,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T00:00:00Z","timestamp":1391126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1186\/1471-2105-15-34","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T04:01:19Z","timestamp":1391140879000},"source":"Crossref","is-referenced-by-count":37,"title":["Efficient sequential and parallel algorithms for planted motif search"],"prefix":"10.1186","volume":"15","author":[{"given":"Marius","family":"Nicolae","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,1,31]]},"reference":[{"key":"6306_CR1","volume-title":"Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, August 19-23","author":"P Pevzner","year":"2000","unstructured":"Pevzner P, Sze S, et al: Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, August 19-23. 2000, AAAI 2000:269\u2013278, , La Jolla \/ San Diego, CA, USA, Volume 8"},{"key":"6306_CR2","volume-title":"Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19","author":"J Lanctot","year":"1999","unstructured":"Lanctot J, Li M, Ma B, Wang S, Zhang L: Distinguishing string selection problems. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19. 1999, ACM\/SIAM 1999:633\u2013642, January , Baltimore, Maryland"},{"issue":"10","key":"6306_CR3","doi-asserted-by":"publisher","first-page":"e48442","DOI":"10.1371\/journal.pone.0048442","volume":"7","author":"Q Yu","year":"2012","unstructured":"Yu Q, Huo H, Zhang Y, Guo H: PairMotif: a new pattern-driven algorithm for planted (l,d) DNA motif search. PLoS ONE. 2012, 7 (10): e48442-10.1371\/journal.pone.0048442.","journal-title":"PLoS ONE"},{"issue":"4","key":"6306_CR4","doi-asserted-by":"publisher","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 and Bioinformatics. 2007, 4 (4): 544-552.","journal-title":"IEEE\/ACM Trans Comput Biol and Bioinformatics"},{"issue":"7","key":"6306_CR5","doi-asserted-by":"publisher","first-page":"e41425","DOI":"10.1371\/journal.pone.0041425","volume":"7","author":"H Dinh","year":"2012","unstructured":"Dinh H, Rajasekaran S, Davila J: qPMS7: A Fast Algorithm for Finding (l,d)-Motifs in DNA and Protein Sequences. PLoS ONE. 2012, 7 (7): e41425-10.1371\/journal.pone.0041425.","journal-title":"PLoS ONE"},{"key":"6306_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1186\/1748-7188-4-14","volume":"4","author":"E Ho","year":"2009","unstructured":"Ho E, Jakubowski C, Gunderson S, et al: iTriplet, a rule-based nucleic acid sequence motif finder. Algo Mol Biol. 2009, 4: 14-10.1186\/1748-7188-4-14.","journal-title":"Algo Mol Biol"},{"key":"6306_CR7","volume-title":"2011 World Congress on Information and Communication Technologies (WICT), Dec 11-14","author":"S Desaraju","year":"2011","unstructured":"Desaraju S, Mukkamala R: Multiprocessor implementation of modeling method for Planted Motif Problem. 2011 World Congress on Information and Communication Technologies (WICT), Dec 11-14. 2011, IEEE 2011:524\u2013529, , Mumbai, India"},{"key":"6306_CR8","doi-asserted-by":"publisher","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 Bioinformatics. 2011, 12: 410-10.1186\/1471-2105-12-410.","journal-title":"BMC Bioinformatics"},{"key":"6306_CR9","volume-title":"IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS","author":"S Bandyopadhyay","year":"2012","unstructured":"Bandyopadhyay S, Sahni S, Rajasekaran S: PMS6: A fast algorithm for motif discovery. IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS. 2012, IEEE 2012:1\u20136, , Las Vegas, NV, USA, February 23-25, 2012"},{"key":"6306_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1186\/1756-0500-4-54","volume":"4","author":"S Rajasekaran","year":"2011","unstructured":"Rajasekaran S, Dinh H: A speedup technique for (l, d)-motif finding algorithms. BMC Res Notes. 2011, 4: 54-10.1186\/1756-0500-4-54. [\n                    http:\/\/www.biomedcentral.com\/1756-0500\/4\/54\n                    \n                  ]","journal-title":"BMC Res Notes"},{"key":"6306_CR11","first-page":"441","volume-title":"Algorithms and Computation, Volume 2223 of Lecture Notes in Computer Science","author":"J Gramm","year":"2001","unstructured":"Gramm J, Niedermeier R, Rossmanith P: Exact solutions for closest string and related problems. Algorithms and Computation, Volume 2223 of Lecture Notes in Computer Science. Edited by: Eades P, Takaoka T. 2001, Berlin Heidelberg: Springer, 441-453."},{"issue":"Suppl 17","key":"6306_CR12","doi-asserted-by":"publisher","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 Bioinformatics. 2012, 13 (Suppl 17): S10-10.1186\/1471-2105-13-S17-S10. [\n                    http:\/\/www.biomedcentral.com\/1471-2105\/13\/S17\/S10\n                    \n                  ]","journal-title":"BMC Bioinformatics"},{"key":"6306_CR13","first-page":"200","volume-title":"2011 International Conference on High Performance Computing & Simulation, HPCS 2012, Istanbul, Turkey, July 4-8, 2011","author":"N Dasari","year":"2011","unstructured":"Dasari N, Ranjan D, Zubair M: High performance implementation of planted motif problem using suffix trees. 2011 International Conference on High Performance Computing & Simulation, HPCS 2012, Istanbul, Turkey, July 4-8, 2011. 2011, IEEE, 200-206."},{"key":"6306_CR14","volume-title":"International Workshop on GPUs and Scientific Applications, GPUScA","author":"N Dasari","year":"2010","unstructured":"Dasari N, Desh R, Zubair M: Solving planted motif problem on GPU. International Workshop on GPUs and Scientific Applications, GPUScA. 2010, Department of Scientific Computing, University of Vienna, TR-10-3 2010, , Vienna, Austria, September 11, 2010"},{"key":"6306_CR15","volume-title":"Proceedings of the","author":"NS Dasari","year":"2010","unstructured":"Dasari NS, Desh R, Zubair M: An efficient multicore implementation of planted motif problem. Proceedings of the. 2010, IEEE 2010:9 \u201315, International Conference on High Performance Computing & Simulation, HPCS 2010, June 28 - July 2, 2010, Caen, France"},{"issue":"4","key":"6306_CR16","first-page":"484","volume":"64","author":"B Sahoo","year":"2011","unstructured":"Sahoo B, Sourav R, Ranjan R, Padhy S: Parallel implementation of exact algorithm for planted motif search problem using SMP cluster. European J Scientific Res. 2011, 64 (4): 484-496.","journal-title":"European J Scientific Res"},{"issue":"19","key":"6306_CR17","doi-asserted-by":"publisher","first-page":"2641","DOI":"10.1093\/bioinformatics\/btr459","volume":"27","author":"H Sun","year":"2011","unstructured":"Sun H, Low M, Hsu W, Tan C, Rajapakse J: Tree-structured algorithm for long weak motif discovery. Bioinformatics. 2011, 27 (19): 2641-2647. 10.1093\/bioinformatics\/btr459.","journal-title":"Bioinformatics"},{"key":"6306_CR18","volume-title":"2010 International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 15-16","author":"HQ Sun","year":"2010","unstructured":"Sun HQ, Low M, Hsu WJ, Rajapakse J: ListMotif: A time and memory efficient algorithm for weak motif discovery. 2010 International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 15-16. 2010, IEEE 2010:254 \u2013260, November , Hangzhou, China"},{"key":"6306_CR19","unstructured":"Faheem HM: Accelerating motif finding problem using grid computing with enhanced brute force. Proceedings of the 12th international conference on Advanced communication technology. ICACT\u201910, Piscataway, NJ, USA: IEEE Press 2010:197\u2013202"},{"key":"6306_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M Tompa","year":"2005","unstructured":"Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, et al: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnol. 2005, 23: 137-144. 10.1038\/nbt1053.","journal-title":"Nature Biotechnol"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-15-34.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-15-34\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-15-34.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T00:42:25Z","timestamp":1548204145000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-15-34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,31]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6306"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-15-34","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,31]]},"article-number":"34"}}