{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:29:00Z","timestamp":1725701340708},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642328930"},{"type":"electronic","value":"9783642328947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32894-7_11","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T21:33:10Z","timestamp":1346535190000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["String Matching with Involutions"],"prefix":"10.1007","author":[{"given":"Cristian","family":"Grozea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Artin, E.: The Gamma function. Holt, Rinehart and Winston (1964)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.10014","volume":"20","author":"R.A. Baeza-Yates","year":"2002","unstructured":"Baeza-Yates, R.A., Navarro, G.: New and faster filters for multiple approximate string matching. Random Struct. Algorithms\u00a020(1), 23\u201349 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-21458-5_31","volume-title":"Combinatorial Pattern Matching","author":"D. Cantone","year":"2011","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"key":"11_CR4","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference, pp. 37\u201351 (2010)"},{"key":"11_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"issue":"11","key":"11_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ipl.2011.02.015","volume":"111","author":"S. Grabowski","year":"2011","unstructured":"Grabowski, S., Faro, S., Giaquinta, E.: String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett.\u00a0111(11), 516\u2013520 (2011)","journal-title":"Inf. Process. Lett."},{"key":"11_CR7","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, New York (1997)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053, 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511566097"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32894-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:19:48Z","timestamp":1620130788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32894-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642328930","9783642328947"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32894-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}