{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:00:51Z","timestamp":1758121251621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449432"},{"type":"electronic","value":"9783319449449"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-44944-9_45","type":"book-chapter","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T16:32:13Z","timestamp":1472833933000},"page":"510-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Computation of Clustered-Clumps in Degenerate Strings"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"Ritu","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Manal","family":"Mohamed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Bassino, F., Cl\u00e9ment, J., Fayolle, J., Nicod\u00e8me, P.: Constructions for clumps statistics. CoRR abs\/0804.3671 (2008)","DOI":"10.46298\/dmtcs.3563"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/11496656_31","volume-title":"Combinatorial Pattern Matching","author":"V Boeva","year":"2005","unstructured":"Boeva, V., Cl\u00e9ment, J., R\u00e9gnier, M., Vandenbogaert, M.: Assessing the significance of sets of words. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 358\u2013370. Springer, Heidelberg (2005)"},{"key":"45_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007). p. 392"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.engappai.2016.01.009","volume":"51","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Iliopoulos, C.S., Kundu, R., Mohamed, M., Vayani, F.: Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51, 109\u2013114 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"45_CR5","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"issue":"22","key":"45_CR6","doi-asserted-by":"publisher","first-page":"4542","DOI":"10.1093\/nar\/23.22.4542","volume":"23","author":"I Kvietikova","year":"1995","unstructured":"Kvietikova, I., Wenger, R.H., Marti, H.H., Gassmann, M.: The transcription factors ATF-1 and CREB-1 bind constitutively to the hypoxia-inducible factor-1 (HIF-1) DNA recognition site. Nucleic Acids Res. 23(22), 4542\u20134550 (1995)","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"GM Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157\u2013169 (1989)","journal-title":"J. Algorithms"},{"issue":"2","key":"45_CR8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM (JACM) 23(2), 262\u2013272 (1976)","journal-title":"J. ACM (JACM)"},{"key":"45_CR9","first-page":"116","volume-title":"Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science","author":"MS Rahman","year":"2007","unstructured":"Rahman, M.S., Iliopoulos, C.S.: Pattern matching algorithms with don\u2019t cares. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F., Bielikova, M. (eds.) SOFSEM 2007, pp. 116\u2013126. Institute of Computer Science AS CR, Prague (2007)"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"R\u00e9gnier, M.: A unified approach to word statistics. In: Proceedings of the Second Annual International Conference on Computational Molecular Biology, RECOMB, USA, pp. 207\u2013213. ACM, New York (1998)","DOI":"10.1145\/279069.279116"},{"issue":"3","key":"45_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 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory, pp. 1\u201311. Institute of Electrical Electronics Engineer (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44944-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T17:02:37Z","timestamp":1657213357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44944-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449432","9783319449449"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44944-9_45","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}