{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:45Z","timestamp":1725566145213},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229896"},{"type":"electronic","value":"9783540301172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30117-2_131","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T09:01:02Z","timestamp":1284800462000},"page":"1080-1083","source":"Crossref","is-referenced-by-count":3,"title":["Processing Repetitive Sequence Structures with Mismatches at Streaming Rate"],"prefix":"10.1007","author":[{"given":"Albert A.","family":"Conti","sequence":"first","affiliation":[]},{"given":"Tom","family":"Van Court","sequence":"additional","affiliation":[]},{"given":"Martin C.","family":"Herbordt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"131_CR1","volume-title":"Bioinformatics: A Practical Guide","author":"G. Schuler","year":"2001","unstructured":"Schuler, G.: Sequence alignment and database searching. In: Baxevanis, A., Ouellette, B. (eds.) Bioinformatics: A Practical Guide, Wiley, Chichester (2001)"},{"key":"131_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1999","unstructured":"Benson, G.: Tandem repeats finder: A program to analyze DNA sequences. Nucleic Acids Research\u00a027, 573\u2013580 (1999)","journal-title":"Nucleic Acids Research"},{"key":"131_CR3","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, Cambridge (1997)"},{"key":"131_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G. Landau","year":"2001","unstructured":"Landau, G., Schmidt, J., Sokol, D.: An algorithm for approximate tandem repeats. J. Computational Biology\u00a08, 1\u201318 (2001)","journal-title":"J. Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Field Programmable Logic and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30117-2_131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T07:50:42Z","timestamp":1553327442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30117-2_131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229896","9783540301172"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30117-2_131","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}