{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:12Z","timestamp":1725491412527},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_8","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"69-77","source":"Crossref","is-referenced-by-count":7,"title":["Finding Common Motifs with Gaps Using Finite Automata"],"prefix":"10.1007","author":[{"given":"Pavlos","family":"Antoniou","sequence":"first","affiliation":[]},{"given":"Jan","family":"Holub","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Bo\u0159ivoj","family":"Melichar","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Peterlongo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Charras, C., Lecroq, T.: Exact string matching algorithms (2004)"},{"key":"8_CR2","first-page":"73","volume":"11","author":"T. Crawford","year":"1998","unstructured":"Crawford, T., Iliopoulos, C.S., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computing in Musicology\u00a011, 73\u2013100 (1998)","journal-title":"Computing in Musicology"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-63220-4_55","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"1997","unstructured":"Crochemore, M., V\u00e9rin, R.: Direct construction of compact directed acyclic word graphs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 116\u2013129. Springer, Heidelberg (1997)"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-3-662-07675-0_9","volume-title":"Handbook of Formal Languages, Linear Modeling: Background and Application, ch. 9","author":"M. Crochemore","year":"1997","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Linear Modeling: Background and Application, ch. 9, vol.\u00a02, pp. 399\u2013462. Springer, Heidelberg (1997)"},{"key":"8_CR5","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Inc., New York (1994)"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(00)00064-5","volume":"249","author":"J. Holub","year":"2000","unstructured":"Holub, J., Melichar, B.: Approximate string matching using factor automata. Theor. Comput. Sci.\u00a0249(2), 305\u2013311 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W., Sagot, M.: A first approach to finding common motifs with gaps. International Journal of Foundations of Computer Science (2004)","DOI":"10.1142\/S0129054105003716"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1089\/cmb.2005.12.686","volume":"12","author":"H.C.M. Leung","year":"2005","unstructured":"Leung, H.C.M.: Finding motifs with insufficient number of strong binding sites. Journal of Computational Biology\u00a012(6), 686\u2013701 (2005)","journal-title":"Journal of Computational Biology"},{"key":"8_CR9","volume-title":"The algorithm design manual","author":"S.S. Skiena","year":"1998","unstructured":"Skiena, S.S.: The algorithm design manual. Springer, New York (1998)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0960-0760(97)00013-7","volume":"62","author":"M.E. Baker","year":"1997","unstructured":"Baker, M.E., Bailey, T.L., Elkan, C.P.: An artificial intelligence approach to motif discovery in protein sequences: Application to steroid dehydrogenases. The Journal of Steroid Biochemistry and Molecular Biology\u00a062(1), 29\u201344 (1997)","journal-title":"The Journal of Steroid Biochemistry and Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:02Z","timestamp":1605644042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11812128_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}