{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T02:10:01Z","timestamp":1736561401576,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457749"},{"type":"electronic","value":"9783540457756"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11880561_31","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:16:48Z","timestamp":1159445808000},"page":"360-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Algorithm for Fast All-Against-All Substring Matching"],"prefix":"10.1007","author":[{"given":"Marina","family":"Barsky","sequence":"first","affiliation":[]},{"given":"Ulrike","family":"Stege","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Upton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: All-against-all sequence matching. Rep.\u00a0Dept.\u00a0of CS, U.\u00a0de Chile (1990)","key":"31_CR1"},{"doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A fast algorithm on average for all-against-all sequence matching. In: Proc.\u00a0SPIRE\/CRIWG 1999, pp. 16\u201323 (1999)","key":"31_CR2","DOI":"10.1109\/SPIRE.1999.796573"},{"doi-asserted-by":"crossref","unstructured":"Barsky, M., Stege, U., Thomo, A., Upton, C.A.: A New Algorithm for Fast All-Against-All Substring Matching (2006), http:\/\/www.cs.uvic.ca\/~mgbarksy\/apbt.pdf","key":"31_CR3","DOI":"10.1007\/11880561_31"},{"key":"31_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"unstructured":"Pevzner, P., Sze, S.H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc.\u00a0ISMB 2000, pp. 269\u2013278 (2000)","key":"31_CR5"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Ukkonen, E.: Algorithms for approximate string matching. Information and Control\u00a064, 100\u2013118 (1985)","journal-title":"Information and Control"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Combinatorial Pattern Matching","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E.: Approximate string matching over suffix trees. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 228\u2013242. Springer, Heidelberg (1993)"},{"unstructured":"Vilo, J.: Pattern Discovery from Biosequences. PhD Thesis, Series of Publications A, Report A-2002-3 U.\u00a0of Helsinki, Finland (2002)","key":"31_CR8"},{"unstructured":"Virus Orthologous Clusters database at Viral Bioinformatics Resource Center, U.\u00a0of Victoria, Canada, http:\/\/athena.bioc.uvic.ca","key":"31_CR9"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11880561_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:33:39Z","timestamp":1736559219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11880561_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457749","9783540457756"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11880561_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}