{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:13:22Z","timestamp":1787505202591,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580942","type":"print"},{"value":"9783540484509","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:26Z","timestamp":1330251086000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["A space efficient algorithm for finding the best non-overlapping alignment score"],"prefix":"10.1007","author":[{"given":"Gary","family":"Benson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M.J. Atallah, L.L. Larmore, and S. Mcfaddin, \u201cEfficient Parallel Algorithms for String Editing and Related Problems,\u201d SIAM J. Comput., 19, pp 968\u2013988, 1990.","journal-title":"SIAM J. Comput."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"S. Kannan and E. Myers, \u201cAn Algorithm for Locating Non-overlapping Regions of Maximum Alignment Score,\u201d Fourth Annual Symposium on Combinatorial Pattern Matching, pp 74\u201386, 1993.","DOI":"10.1007\/BFb0029798"},{"key":"1_CR3","unstructured":"Z.M. Kedem and H. Fuchs, \u201cOn finding several shortest paths in certain graphs,\u201d Proc. 18th Allerton Conference on Communication, Control and Computing, pp 677\u2013683, October 1980."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"G. Landau and J. Schmidt, \u201cAn algorithm for Approximate Tandem Repeats,\u201d Fourth Annual Symposium on Combinatorial Pattern Matching, pp 120\u2013133, 1993.","DOI":"10.1007\/BFb0029801"},{"key":"1_CR5","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"V.I. Levenshtein, \u201cBinary codes capable of correcting deletions, insertions and reversals,\u201d Soviet Phys. Dokl., 10, pp707\u2013710, 1966.","journal-title":"Soviet Phys. Dokl."},{"key":"1_CR6","unstructured":"W. Miller, \u201cAn algorithm for locating a repeating region,\u201d manuscript, 1992."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E. Myers","year":"1986","unstructured":"E. Myers, \u201cAn O(ND) difference algorithm and its variants,\u201d Algorithmica, 1, pp 251\u2013266, 1986.","journal-title":"Algorithmica"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"T.F. Smith and M.S. Waterman, \u201cIdentification of common molecular sequences,\u201d J. Mol. Biol., 147, pp 195\u2013197, 1981.","journal-title":"J. Mol. Biol."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"R.A. Wagner and M.J. Fisher, \u201cThe string-to-string correction problem,\u201d J. ACM, 21, pp 168\u2013173, 1974.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:10:50Z","timestamp":1619557850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}