{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:39Z","timestamp":1725544059606},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_31","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"342-353","source":"Crossref","is-referenced-by-count":6,"title":["New Algorithms for Text Fingerprinting"],"prefix":"10.1007","author":[{"given":"Roman","family":"Kolpakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Raffinot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5-6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S1570-8667(03)00035-2","volume":"1","author":"A. Amir","year":"2003","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via parikh mapping. J. Discrete Algorithms\u00a01(5-6), 409\u2013421 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"31_CR2","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"31_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-39763-2_2","volume-title":"Algorithms in Bioinformatics","author":"G. Didier","year":"2003","unstructured":"Didier, G.: Common intervals of two sequences. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 17\u201324. Springer, Heidelberg (2003)"},{"unstructured":"Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings (submitted, 2004)","key":"31_CR4"},{"doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Raffinot, M.: New Algorithms for Text Fingerprinting (unpublished, 2006) (submitted), http:\/\/www-igm.univ-mlv.fr\/~raffinot\/ftp\/~fingerprint.pdf","key":"31_CR5","DOI":"10.1007\/11780441_31"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:19Z","timestamp":1619507779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11780441_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}