{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:13:24Z","timestamp":1725819204748},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319164793"},{"type":"electronic","value":"9783319164809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16480-9_22","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T11:09:53Z","timestamp":1426504193000},"page":"219-230","source":"Crossref","is-referenced-by-count":0,"title":["SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching"],"prefix":"10.1007","author":[{"given":"Ali","family":"Alatabbi","sequence":"first","affiliation":[]},{"given":"Shuhana","family":"Azmin","sequence":"additional","affiliation":[]},{"given":"Md. Kawser","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"22_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"issue":"Web-Server-Issu","key":"22_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1093\/nar\/gkp335","volume":"37","author":"T.L. Bailey","year":"2009","unstructured":"Bailey, T.L., Bod\u00e9n, M., Buske, F.A., Frith, M.C., Grant, C.E., Clementi, L., Ren, J., Li, W.W., Noble, W.S.: MEME SUITE: tools for motif discovery and searching. Nucleic Acids Research\u00a037(Web-Server-Issue), 202\u2013208 (2009)","journal-title":"Nucleic Acids Research"},{"issue":"Web-Server-Issu","key":"22_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1093\/nar\/gkl198","volume":"34","author":"T.L. Bailey","year":"2006","unstructured":"Bailey, T.L., Williams, N., Misleh, C., Li, W.W.: MEME: discovering and analyzing DNA and protein sequence motifs. Nucleic Acids Research\u00a034(Web-Server-Issue), 369\u2013373 (2006)","journal-title":"Nucleic Acids Research"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2012.03.029","volume":"443","author":"P. Bille","year":"2012","unstructured":"Bille, P., Gortz, I.L., Vildhoj, H.W., Wind, D.K.: String matching with variable length gaps. Theor. Comput. Sci.\u00a0443, 25\u201334 (2012)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bille, P., Thorup, M.: Regular expression matching with multi\u2013strings and intervals. In: Charikar, M. (ed.) ACM\u2013SIAM Symp. on Discrete Algorithms, pp. 1297\u20131308. SIAM (2010)","key":"22_CR5","DOI":"10.1137\/1.9781611973075.104"},{"issue":"10","key":"22_CR6","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Crochemore, M., Sagot, M.-F.: 1. motifs in sequences. In: Compact Handbook of Computational Biology, p. 47 (2004)","key":"22_CR7","DOI":"10.1201\/9780203021415.ch3"},{"issue":"4","key":"22_CR8","first-page":"397","volume":"13","author":"W.N. Grundy","year":"1997","unstructured":"Grundy, W.N., Bailey, T.L., Elkan, C., Baker, M.E.: Meta-meme: motif-based hidden markov models of protein families. Computer Applications in the Biosciences\u00a013(4), 397\u2013406 (1997)","journal-title":"Computer Applications in the Biosciences"},{"key":"22_CR9","series-title":"CCIS","first-page":"58","volume-title":"BIRD 2008","author":"M. Halachev","year":"2008","unstructured":"Halachev, M., Shiri, N.: Fast structured motif search in DNA sequences. In: Elloumi, M., K\u00fcng, J., Linial, M., Murphy, R.F., Schneider, K., Toma, C. (eds.) BIRD 2008. CCIS, vol.\u00a013, pp. 58\u201373. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Hulo, N., Bairoch, A., Bulliard, V., Cerutti, L., De Castro, E., Langendijk-Genevaux, P.S., Pagni, M., Sigrist, C.J.A.: The prosite database. Nucleic Acids Research\u00a034(suppl. 1), D227\u2013D230 (2006)","key":"22_CR10","DOI":"10.1093\/nar\/gkj063"},{"issue":"12","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1093\/bioinformatics\/17.12.1234","volume":"17","author":"T. Junier","year":"2001","unstructured":"Junier, T., Pagni, M., Bucher, P.: mmsearch: a motif arrangement language and search program. Bioinformatics\u00a017(12), 1234\u20131235 (2001)","journal-title":"Bioinformatics"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"issue":"8","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1089\/cmb.2005.12.1065","volume":"12","author":"M. Morgante","year":"2005","unstructured":"Morgante, M., Policriti, A., Vitacolonna, N., Zuccolo, A.: Structured motifs search. Journal of Computational Biology\u00a012(8), 1065\u20131082 (2005)","journal-title":"Journal of Computational Biology"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps patternmatching, with application to protein searching. In: RECOMB, pp. 231\u2013240 (2001)","key":"22_CR14","DOI":"10.1145\/369133.369220"},{"issue":"6","key":"22_CR15","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1089\/106652703322756140","volume":"10","author":"G. Navarro","year":"2003","unstructured":"Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. Journal of Computational Biology\u00a010(6), 903\u2013923 (2003)","journal-title":"Journal of Computational Biology"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1186\/1471-2105-15-235","volume":"15","author":"S.P. Pissis","year":"2014","unstructured":"Pissis, S.P.: Motex-ii: structured motif extraction from large-scale datasets. BMC Bioinformatics\u00a015, 235 (2014)","journal-title":"BMC Bioinformatics"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11809678_17","volume-title":"Computing and Combinatorics","author":"M.S. Rahman","year":"2006","unstructured":"Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M., Smyth, W.F.: Finding patterns with variable length gaps or don\u2019t cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 146\u2013155. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Sigrist, C.J.A., de Castro, E., Cerutti, L., Cuche, B.A., Hulo, N., Bridge, A., Bougueleret, L., Xenarios, I.: New and continuing developments at prosite. Nucleic Acids Research\u00a041(D1), D344\u2013D347 (2013)","key":"22_CR18","DOI":"10.1093\/nar\/gks1067"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zaki, M.J.: SMOTIF: efficient structured pattern and profile motif search. Algorithms for Molecular Biology, 1 (2006)","key":"22_CR19","DOI":"10.1186\/1748-7188-1-22"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics and Biomedical Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16480-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T21:35:29Z","timestamp":1566423329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-16480-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319164793","9783319164809"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16480-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}