{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:31:31Z","timestamp":1757539891491},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0196-6774(90)90031-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"85-101","source":"Crossref","is-referenced-by-count":49,"title":["Sequence comparison with mixed convex and concave costs"],"prefix":"10.1016","volume":"11","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90031-9_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0196-6774(90)90031-9_BIB2","series-title":"29th ACM Symp. Foundations of Computer Science","first-page":"497","article-title":"Searching in multidimensional monotone matrices","author":"Aggarwal","year":"1988"},{"key":"10.1016\/0196-6774(90)90031-9_BIB3","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(90)90031-9_BIB4","series-title":"29th ACM Symp. Foundations of Computer Science","first-page":"488","article-title":"Speeding up dynamic programming","author":"Eppstein","year":"1988"},{"key":"10.1016\/0196-6774(90)90031-9_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(89)90101-1","article-title":"Speeding up dynamic programming with application to molecular biology","volume":"64","author":"Galil","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(90)90031-9_BIB6","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0216043","article-title":"The least weight subsequence problem","volume":"16","author":"Hirschberg","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(90)90031-9_BIB7","series-title":"An almost linear algorithm for generalized matrix searching","author":"Klawe","year":"1987"},{"key":"10.1016\/0196-6774(90)90031-9_BIB8","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1002\/spe.4380111102","article-title":"Breaking paragraphs into lines","volume":"11","author":"Knuth","year":"1981","journal-title":"Software Practice Experience"},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90031-9_BIB9","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90031-9_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02459948","article-title":"Sequence comparison with concave weighting functions","volume":"50","author":"Miller","year":"1988","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/0196-6774(90)90031-9_BIB11","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983"},{"key":"10.1016\/0196-6774(90)90031-9_BIB12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF02459498","article-title":"General methods of sequence comparison","volume":"46","author":"Waterman","year":"1984","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/0196-6774(90)90031-9_BIB13","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0196-8858(86)90025-4","article-title":"Rapid dynamic programming algorithms for RNA secondary structure","volume":"7","author":"Waterman","year":"1986","journal-title":"Adv. in Appl. Math."},{"issue":"No. 3","key":"10.1016\/0196-6774(90)90031-9_BIB14","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/0196-6774(88)90032-6","article-title":"The concave least weight subsequence problem revisited","volume":"9","author":"Wilber","year":"1988","journal-title":"J. Algorithms"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:11Z","timestamp":1548744851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677490900319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0196677490900319"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90031-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}