{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:33:00Z","timestamp":1775302380090,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)92848-r","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"357-369","source":"Crossref","is-referenced-by-count":26,"title":["A space efficient algorithm for finding the best nonoverlapping alignment score"],"prefix":"10.1016","volume":"145","author":[{"given":"Gary","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)92848-R_BIB1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","article-title":"Efficient parallel algorithms for string editing and related problems","volume":"19","author":"Apostolico","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)92848-R_BIB2","series-title":"4th Ann. Symp. on Combinatorial Pattern Matching","first-page":"74","article-title":"An algorithm for locating non-overlapping regions of maximum alignment score","volume":"Vol. 648","author":"Kannan","year":"1993"},{"key":"10.1016\/0304-3975(95)92848-R_BIB3","series-title":"Proc. 18th Allerton Conf. on Communication Control and Computing","first-page":"677","article-title":"On finding several shortest paths in certain graphs","author":"Kedem","year":"1980"},{"key":"10.1016\/0304-3975(95)92848-R_BIB4","series-title":"Proc. 4th Ann. Symp. on Combinatorial Pattern Matching","first-page":"120","article-title":"An algorithm for approximate tandem repeats","volume":"Vol. 648","author":"Landau","year":"1993"},{"key":"10.1016\/0304-3975(95)92848-R_BIB5","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0304-3975(95)92848-R_BIB6","series-title":"An algorithm for locating a repeating region","author":"Miller","year":"1992"},{"key":"10.1016\/0304-3975(95)92848-R_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","article-title":"An O(ND) difference algorithm and its variants","volume":"1","author":"Myers","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(95)92848-R_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular sequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"key":"10.1016\/0304-3975(95)92848-R_BIB9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string to string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759592848R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759592848R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:54:58Z","timestamp":1555390498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759592848R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759592848R"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)92848-r","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}