{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:15:30Z","timestamp":1648804530618},"reference-count":22,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":["Information Sciences"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0255(97)10032-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T20:00:31Z","timestamp":1049486431000},"page":"189-207","source":"Crossref","is-referenced-by-count":6,"title":["On computing all suboptimal alignments"],"prefix":"10.1016","volume":"105","author":[{"family":"Kun-Mao Chao","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(97)10032-9_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0149012","article-title":"Trees, stars, and multiple biological sequence alignment","volume":"49","author":"Altschul","year":"1989","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB3","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\/S0020-0255(97)10032-9_BIB4","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1137\/0148063","article-title":"The multiple sequence alignment problem in biology","volume":"48","author":"Carrillo","year":"1988","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB5","series-title":"Proceedings of the Fifth Symposium on Combinatorial Pattern Matching","first-page":"31","article-title":"Computing all suboptimal alignments in linear space","volume":"vol. 807","author":"Chao","year":"1994"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB6","first-page":"387","article-title":"Locating well-conserved regions within a pairwise alignment","volume":"9","author":"Chao","year":"1993","journal-title":"CABIOS"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB7","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\/S0020-0255(97)10032-9_BIB8","first-page":"45","article-title":"Reduced space sequence alignment","volume":"13","author":"Grice","year":"1997","journal-title":"CABIOS"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB9","first-page":"6018","article-title":"Phylogenetic footprinting reveals unexpected complexity in trans factor binding upstream from the \u03b5-globin gene","volume":"90","author":"Gumucio","year":"1993"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.3109\/10425179309015629","article-title":"Positive and negative regulatory elements of the rabbit embryonic \u03b5-globin gene revealed by an improved multiple alignment program and functional analysis","volume":"4","author":"Hardison","year":"1993","journal-title":"DNA Sequence"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB12","series-title":"Notes on a multiple sequence alignment cost bound of Carrillo and Lipman","author":"Kececioglu","year":"1989"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB13","first-page":"33","article-title":"Mapping and interpreting biological information","volume":"34","author":"Lander","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF02462324","article-title":"Optimized homology searches of the gene and protein sequence data banks","volume":"48","author":"Lawerence","year":"1986","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB15","first-page":"11","article-title":"Optimal alignments in linear space","volume":"4","author":"Myers","year":"1988","journal-title":"CABIOS"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","article-title":"Approximate matching of regular expressions","volume":"51","author":"Myers","year":"1989","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB17","series-title":"Proceedings of the Fourth Symposium on Combinatorial Pattern Matching","first-page":"179","article-title":"On suboptimal alignments of biological sequences","volume":"vol. 684","author":"Naor","year":"1993"},{"key":"10.1016\/S0020-0255(97)10032-9_BIB18","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/0022-2836(91)90667-U","article-title":"A simple method to generate non-trivial alternative alignments of protein sequences","volume":"219","author":"Saqi","year":"1991","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB19","doi-asserted-by":"crossref","first-page":"7469","DOI":"10.1016\/0022-2836(88)90011-3","article-title":"Embryonic \u03b5 and \u03b3 globin genes of a prosimian primate (Galago crassicaudatus): Nucleotide and amino acid sequences, developmental regulation and phylogenetic footprints","volume":"203","author":"Tagle","year":"1988","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB20","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1093\/protein\/3.7.565","article-title":"Determination of reliable regions in protein sequence alignment","volume":"3","author":"Vingron","year":"1990","journal-title":"Protein Eng."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0025-5564(85)90096-3","article-title":"A dynamic programming algorithm to find all solutions in a neighborhood of the optimum","volume":"77","author":"Waterman","year":"1985","journal-title":"Math. Biosci."},{"key":"10.1016\/S0020-0255(97)10032-9_BIB22","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0022-2836(91)80062-Y","article-title":"Suboptimal sequence alignment in molecular biology: Alignment with error analysis","volume":"221","author":"Zuker","year":"1991","journal-title":"J. Mol. Biol."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597100329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597100329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:28:04Z","timestamp":1556044084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025597100329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":22,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020025597100329"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(97)10032-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}