{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:48Z","timestamp":1760245008673,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3669,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0893-9659(03)00083-1","type":"journal-article","created":{"date-parts":[[2003,9,11]],"date-time":"2003-09-11T17:05:40Z","timestamp":1063299940000},"page":"785-790","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["An optimization approach to multiple sequence alignment"],"prefix":"10.1016","volume":"16","author":[{"given":"F.Y.","family":"Hunt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Kearsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honghui","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1998","series-title":"Gap Heuristics and Tree Construction Using Gaps","author":"Korostensky","key":"10.1016\/S0893-9659(03)00083-1_BIB1"},{"issue":"2","key":"10.1016\/S0893-9659(03)00083-1_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1089\/cmb.1998.5.173","article-title":"Sequence alignment in molecular biology","volume":"5","author":"Apostolico","year":"1998","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0893-9659(03)00083-1_BIB3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Bio."},{"year":"1998","series-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"Durbin","key":"10.1016\/S0893-9659(03)00083-1_BIB4"},{"year":"1995","series-title":"Introduction to Computational Biology","author":"Waterman","key":"10.1016\/S0893-9659(03)00083-1_BIB5"},{"year":"1999","series-title":"Constrained Markov Decision Processes","author":"Altman","key":"10.1016\/S0893-9659(03)00083-1_BIB6"},{"year":"1970","series-title":"Applied Probability Models with Optimization Applications","author":"Ross","key":"10.1016\/S0893-9659(03)00083-1_BIB7"},{"year":"1997","series-title":"Primal Dual Interior Point Methods","author":"Wright","key":"10.1016\/S0893-9659(03)00083-1_BIB8"},{"year":"1983","series-title":"Linear Programming","author":"Chv\u00e1tal","key":"10.1016\/S0893-9659(03)00083-1_BIB9"},{"year":"1996","author":"Czyzyk","key":"10.1016\/S0893-9659(03)00083-1_BIB10"},{"key":"10.1016\/S0893-9659(03)00083-1_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.4.3.267","article-title":"Implementing the simplex method: The initial basis","volume":"4","author":"Bixby","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0893-9659(03)00083-1_BIB12","unstructured":"F. Hunt, A.J. Kearsley and A. O'Gallagher, Software for optimization-based multiple sequence alignment, Technical Report, Mathematical and Computational Science Division, National Institute of Standards and Technology, Gaithersburg, MD."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903000831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965903000831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:09:52Z","timestamp":1760238592000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965903000831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0893965903000831"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(03)00083-1","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2003,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An optimization approach to multiple sequence alignment","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(03)00083-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}