{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:45:35Z","timestamp":1775245535138,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811329067","type":"print"},{"value":"9789811329074","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-2907-4_12","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T08:22:11Z","timestamp":1538814131000},"page":"136-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on Algorithms for Planted (l,d) Motif Search"],"prefix":"10.1007","author":[{"given":"Li","family":"Anya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,7]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/11758525_110","volume-title":"Computational Science \u2013 ICCS 2006","author":"J Davila","year":"2006","unstructured":"Davila, J., Balla, S., Rajasekaran, S.: Space and time efficient algorithms for planted motif search. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006 Part II. LNCS, vol. 3992, pp. 822\u2013829. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11758525_110"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1093\/bib\/bbs016","volume":"14","author":"F Zambelli","year":"2013","unstructured":"Zambelli, F., Pesole, G., Pavesi, G.: Motif discovery and transcription factor binding sites before and after the next-generation sequencing era. Brief Bioinform. 14(2), 225\u2013238 (2013)","journal-title":"Brief Bioinform."},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1093\/bib\/bbp032","volume":"10","author":"J Mrazek","year":"2009","unstructured":"Mrazek, J.: Finding sequence motifs in prokaryotic Genomes-brief practical guide for a micro-biologist. Brief. Bioinform. 10(5), 525\u2013536 (2009)","journal-title":"Brief. Bioinform."},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1038\/nbt0406-423","volume":"24","author":"P D\u2019haeseleer","year":"2006","unstructured":"D\u2019haeseleer, P.: What are DNA sequence motif. Nat. Biotechnol. 24(4), 423\u2013425 (2006)","journal-title":"Nat. Biotechnol."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"15","key":"12_CR6","doi-asserted-by":"publisher","first-page":"4899","DOI":"10.1093\/nar\/gki791","volume":"33","author":"J Hu","year":"2005","unstructured":"Hu, J., Li, B., Kihara, D.: Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res. 33(15), 4899\u20134913 (2005)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-1074-x","volume":"17","author":"L Ramp\u00e1\u0161ek","year":"2016","unstructured":"Ramp\u00e1\u0161ek, L., Jimenez, R.M., Lupt\u00e1k, A., et al.: RNA motif search with data-driven element ordering. BMC Bioinform. 17(1), 1\u201310 (2016)","journal-title":"BMC Bioinform."},{"issue":"4","key":"12_CR8","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. Bioinf. 4(4), 544\u2013552 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"9","key":"12_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1186\/s12859-016-1130-6","volume":"17","author":"Q Yu","year":"2016","unstructured":"Yu, Q., Huo, H., Zhao, R., et al.: RefSelect: a reference sequence selection algorithm for planted (l,d) motif search. BMC Bioinformatics 17(9), 266\u2013281 (2016)","journal-title":"BMC Bioinformatics"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"He, B., Fang, W., et al.: Mars: a MapReduce framework on graphics processors. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 260\u2013269. IEEE (2017)","DOI":"10.1145\/1454115.1454152"},{"issue":"15","key":"12_CR11","doi-asserted-by":"publisher","first-page":"4899","DOI":"10.1093\/nar\/gki791","volume":"33","author":"J Hu","year":"2005","unstructured":"Hu, J., Li, B., Kihara, D.: Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res. 33(15), 4899\u20134913 (2005)","journal-title":"Nucleic Acids Res."},{"key":"12_CR12","volume-title":"Improved Exact Enumerative Algorithms for the Planted(l,d)-Motif Search Problem","author":"S Tanaka","year":"2014","unstructured":"Tanaka, S.: Improved Exact Enumerative Algorithms for the Planted(l,d)-Motif Search Problem. IEEE Computer Society Press, Washington, D.C. (2014)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","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 4(1), 1\u20137 (2011)","journal-title":"BMC Res. Notes"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Peng, X., Pal, S., Rajasekaran, S.: qPMS10: a randomized algorithm for efficiently solving quorum Planted Motif Search problem. In: IEEE International Conference on Bioinformatics and Biomedicine, pp. 670\u2013675. IEEE (2017)","DOI":"10.1109\/BIBM.2016.7822598"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ins.2013.03.023","volume":"237","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yang, J., Zhao, Y., et al.: An improved voting algorithm for planted (l,d) motif search. Inf. Sci. 237, 305\u2013312 (2013)","journal-title":"Inf. Sci."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jnca.2013.04.002","volume":"39","author":"E Tong","year":"2014","unstructured":"Tong, E., et al.: Bloom filter-based workflow management to enable QoS guarantee in wireless sensor networks. J. Netw. Comput. Appl. 39, 38\u201351 (2014)","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Communications in Computer and Information Science","Applications and Techniques in Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2907-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:46:34Z","timestamp":1775241994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-13-2907-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811329067","9789811329074"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2907-4_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Techniques in Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanning","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atis2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.atis2018.conferences.academy\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}