{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:46Z","timestamp":1725484306116},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","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":[[2002]]},"DOI":"10.1007\/3-540-45452-7_12","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"133-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identifying Occurrences of Maximal Pairs in Multiple Strings"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spiros","family":"Sioutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"A. Apostolico and Z. Galil. Pattern Matching Algorithms. Oxford University Press, ISBN 0-19-611367-5, 1997.","DOI":"10.1093\/oso\/9780195113679.001.0001"},{"issue":"0","key":"12_CR2","first-page":"1","volume":"0","author":"G. S. Brodal","year":"2000","unstructured":"G. S. Brodal, R. B. Lyngs, C. N. Storm Pedersen and DKFZ Jens Stoye. Finding Maximal Pairs with Bounded Gaps. Journal of Discrete Algorithms, 0(0):1\u201327, 2000.","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M. R. Brown","year":"1979","unstructured":"M. R. Brown and R. E. Tarjan. A Fast Merging Algorithm. Journal of the ACM, 26(2):211\u2013226, 1979.","journal-title":"Journal of the ACM"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M. R. Brown","year":"1980","unstructured":"M. R. Brown and R. E. Tarjan. Design and Analysis of a Data Structure for Rep-resenting Sorted Lists. SIAM Journal on Computing, 9:594\u2013614, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR5","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, ISBN 0-521-58519-8, 1999."},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"G. Navarro. A Guided Tour to Approximate String Matching. ACM Computing Surveys, 33(1):31\u201388, 2001.","journal-title":"ACM Computing Surveys"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"G. A. Stephen. String Searching Algorithms. Lecture Notes Series on Computing-Vol. 3, World Scientific Publishing, ISBN 981-02-1829-X, 1994.","DOI":"10.1142\/9789814317368"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen. Finding Approximate atterns in strings. Journal of Algorithms, 6:132\u2013137, 1985.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T21:31:46Z","timestamp":1683840706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"21 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}