{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:33:49Z","timestamp":1729622029558,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/rice.2018.8509078","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:42:00Z","timestamp":1540510920000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Exact Planted (l, d) Motif Search Algorithms: A Review"],"prefix":"10.1109","author":[{"given":"Satarupa","family":"Mohanty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suneeta","family":"Mohanty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharmistha","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1504\/IJBRA.2014.062990"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0048442"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BFb0054337","article-title":"Spelling approximate repeated or common motifs using a suffix tree","author":"sagot","year":"1998","journal-title":"Proceedings of the Third Latin American Theoretical Informatics Symposium (LATIN)"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/332306.332553","article-title":"Extracting structured motifs using a suffix tree Algorithms and application to promoter consensus identification","author":"marsan","year":"2000","journal-title":"Fourth Annual International Conference on Computational Molecular Biology (RECOMB)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/967900.967932"},{"key":"ref17","first-page":"757","article-title":"RISOTTO: Fast extraction of motifs with mismatches","author":"pisanti","year":"2006","journal-title":"Proc Seventh Latin Am Symp Theoretical Informatics (LATIN '06)"},{"key":"ref18","article-title":"EXMOTIF: Efficient structured motif extraction","volume":"1","author":"zhang","year":"2006","journal-title":"Algorithms for Molecular Biology"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2014.07.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2005.12.1117"},{"key":"ref3","article-title":"Algorithms for Motif Search","author":"rajasekaran","year":"2001","journal-title":"University of Connecticut"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_110"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48540-7_17"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1186\/1756-0500-4-54","article-title":"A Speedup Technique for (1, d)Motif Finding Algorithms","volume":"4","author":"rajasekaran","year":"2011","journal-title":"BMC Research Notes"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-11-S8-S1","article-title":"Efficient Motif Finding Algorithms for Large-Alphabet Inputs","volume":"11","author":"kuksa","year":"2010","journal-title":"BMC Bioinformatics"},{"key":"ref2","first-page":"106","article-title":"Motif Discovery in Biological Sequences","author":"pradhan","year":"2008","journal-title":"Master's Projects"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-410"},{"key":"ref1","first-page":"1510","article-title":"A Review Appling Genetic Algorithm for Motif Discovery","volume":"3","author":"chauhan","year":"2012","journal-title":"International Journal of Computer Applications in Technology"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.70241"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl147"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/9781848162525_0016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.11.008"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CIBCB.2007.4221233"},{"key":"ref26","first-page":"269","article-title":"Combinatorial approaches to finding subtle signals in DNA sequences","author":"pevzner","year":"2000","journal-title":"Proc Eighth Int Conf Intell Syst Mol Biol"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2010.06.003"}],"event":{"name":"2018 International Conference on Research in Intelligent and Computing in Engineering (RICE)","start":{"date-parts":[[2018,8,22]]},"location":"San Salvador","end":{"date-parts":[[2018,8,24]]}},"container-title":["2018 International Conference on Research in Intelligent and Computing in Engineering (RICE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488872\/8509031\/08509078.pdf?arnumber=8509078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T11:23:59Z","timestamp":1693999439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8509078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/rice.2018.8509078","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}