{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:29Z","timestamp":1794339929824,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_67","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"670-681","source":"Crossref","is-referenced-by-count":0,"title":["Fast Motif Search in Protein Sequence Databases"],"prefix":"10.1007","author":[{"given":"Elena","family":"Zheleva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdullah N.","family":"Arslan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"67_CR1","first-page":"255","volume-title":"Handbook of Theoretical Computer Science: Algorithms and Complexity","author":"A. Aho","year":"1990","unstructured":"Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Algorithms and Complexity, vol.\u00a05, pp. 255\u2013300. Elsevier Science Publishers B.V, Amsterdam (1990)"},{"key":"67_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11682462_15","volume-title":"LATIN 2006: Theoretical Informatics","author":"A.N. Arslan","year":"2006","unstructured":"Arslan, A.N.: Efficient approximate dictionary look-up for long words over small alphabets. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 118\u2013129. Springer, Heidelberg (2006)"},{"key":"67_CR3","unstructured":"Bieganski, P., Riedl, J., Carlis, J.V., Retzel, E.F.: Motif explorer - a tool for interactive exploration of aminoacid sequence motifs. In: Proceedings of Pacific Symposium on Biocomputing (1996)"},{"key":"67_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1093\/nar\/gkg095","volume":"31","author":"B. Boeckmann","year":"2003","unstructured":"Boeckmann, B., Bairoch, A., Apweiler, R., Blatter, M.-C., Estreicher, A., Gasteiger, E., Martin, M.J., Michoud, K., Phan, I., O\u2019Donovan, C., Pilbout, S., Schneider, M.: The swiss-prot protein knowledgebase and its supplement trembl in 2003. Nucleic Acids Research\u00a031, 365\u2013370 (2003)","journal-title":"Nucleic Acids Research"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/30.1.235","volume":"30","author":"L. Falquet","year":"2002","unstructured":"Falquet, L., Pagni, M., Bucher, P., Hulo, N., Sigrist, C.J., Hofmann, K., Bairoch, A.: The prosite database, its status in 2002. Nucleic Acids Research\u00a030, 235\u2013238 (2002)","journal-title":"Nucleic Acids Research"},{"key":"67_CR6","first-page":"107","volume":"1","author":"A. Gattiker","year":"2002","unstructured":"Gattiker, A., Gasteiger, E., Bairoch, A.: Scanprosite: a reference implementation of a prosite scanning tool. Applied Bioinformatics\u00a01, 107\u2013108 (2002)","journal-title":"Applied Bioinformatics"},{"key":"67_CR7","unstructured":"Gerzic, A.: Write your own regular expression parser (2003), \n                    \n                      http:\/\/www.codeguru.com\/CppCppcpp_mfc\/parsing\/article.php\/c4093\/"},{"key":"67_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"67_CR9","unstructured":"Kreibich, C.: libstree - a generic suffix tree library (2004), \n                    \n                      http:\/\/www.cl.cam.ac.uk\/~cpk25\/libstree\/"},{"key":"67_CR10","volume-title":"Data Structures and Algorithms: Sorting and Searching","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: Data Structures and Algorithms: Sorting and Searching. Springer, Heidelberg (1977)"},{"key":"67_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix-trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:55Z","timestamp":1619492635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11753728_67","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}