{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:07:01Z","timestamp":1773270421414,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0893-9659(01)00085-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:05:36Z","timestamp":1027577136000},"page":"11-16","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"title":["A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences"],"prefix":"10.1016","volume":"15","author":[{"given":"B.","family":"Morgenstern","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(01)00085-4_BIB1","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. Biol."},{"key":"10.1016\/S0893-9659(01)00085-4_BIB2","doi-asserted-by":"crossref","first-page":"12098","DOI":"10.1073\/pnas.93.22.12098","article-title":"Multiple DNA and protein sequence alignment based on segment-to-segment comparison","volume":"93","author":"Morgenstern","year":"1996","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1093\/bioinformatics\/15.3.211","article-title":"DIALIGN 2: Improvement of the segment-to-segment approach to multiple sequence alignment","volume":"15","author":"Morgenstern","year":"1999","journal-title":"Bioinformatics"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB4","unstructured":"S. Abdedda\u00efm and B. Morgenstern, Speeding up the DIALIGN multiple alignment program by using the \u2018greedy alignment of biological sequences library\u2019 (GABIOS-LIB), In Proceedings of the Journ\u00e9es Ouvertes: Biologie, Informatique et Math\u00e9matiques (JOBIM), Lecture Notes in Computer Science, (in press)."},{"key":"10.1016\/S0893-9659(01)00085-4_BIB5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/bioinformatics\/15.3.203","article-title":"An exact solution for the segment-to-segment multiple sequence alignment problem","volume":"15","author":"Lenhof","year":"1999","journal-title":"Bioinformatics"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","article-title":"A polyhedral approach to sequence alignment problems","volume":"104","author":"Kececioglu","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB7","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1073\/pnas.80.3.726","article-title":"Rapid similarity searches of nucleic acid and protein data banks","volume":"80","author":"Wilbur","year":"1983","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01188583","article-title":"Linear-space algorithms that build local alignments from fragments","volume":"13","author":"Chao","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/146637.146650","article-title":"Sparse dynamic programming I: Linear cost functions","volume":"39","author":"Eppstein","year":"1992","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0893-9659(01)00085-4_BIB10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB11","first-page":"11","article-title":"Optimal alignments in linear space","volume":"4","author":"Myers","year":"1988","journal-title":"CABIOS"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB12","doi-asserted-by":"crossref","unstructured":"B. Morgenstern, A space-efficient algorithm for aligning large genomic sequences, Bioinformatics 16, 948-949.","DOI":"10.1093\/bioinformatics\/16.10.948"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB13","article-title":"Consistent equivalence relations: A set-theoretical framework for multiple sequence alignment","volume":"133","author":"Morgenstern","year":"1999"},{"key":"10.1016\/S0893-9659(01)00085-4_BIB14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","article-title":"BAliBASE: A benchmark alignment database for the evaluation of multiple sequence alignment programs","volume":"15","author":"Thompson","year":"1999","journal-title":"Bioinformatics"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901000854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901000854?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:01:13Z","timestamp":1760238073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965901000854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0893965901000854"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(01)00085-4","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(01)00085-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}