{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:53:26Z","timestamp":1740135206863,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T00:00:00Z","timestamp":1529020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s12859-018-2228-9","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T21:49:19Z","timestamp":1529012959000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A short note on dynamic programming in a band"],"prefix":"10.1186","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-5698","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"Gibrat","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,15]]},"reference":[{"key":"2228_CR1","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore M, Rytter W. Text Algorithms. New York: Oxford University Press; 1994. p. 412. ISBN 0-19-508609-0."},{"key":"2228_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/nar\/12.1Part1.175","volume":"12","author":"J. Fickett","year":"1984","unstructured":"Fickett J.Fast optimal alignment. Nucleic Acids Res. 1984; 12:175\u20139.","journal-title":"Nucleic Acids Res"},{"key":"2228_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg DS. A linear space algorithm for computing maximal common subsequences. Commun ACM. 1975; 18:341\u20133.","journal-title":"Commun ACM"},{"key":"2228_CR4","first-page":"373","volume":"6","author":"X Huang","year":"1990","unstructured":"Huang X, Hardison RC, Miller W. A space-efficient algorithm for local similarities. Comput Appl Biosci. 1990; 6:373\u201381.","journal-title":"Comput Appl Biosci"},{"key":"2228_CR5","doi-asserted-by":"crossref","unstructured":"Jackson BN, Aluru S. Pairwise Sequence Alignment In: Aluru S, editor. Handbook of Computational Molecular Biology. Chapman and Hall\/CRC: 2005. p. 1\u201332.","DOI":"10.1201\/9781420036275.pt1"},{"key":"2228_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek WJ, Paterson MS. A faster algorithm computing string edit distances. J Comput Syst Sci. 1980; 20:18\u201331.","journal-title":"J Comput Syst Sci"},{"key":"2228_CR7","first-page":"11","volume":"4","author":"EW Myers","year":"1988","unstructured":"Myers EW, Miller W. Optimal alignments in linear space. Comput Appl Biosci. 1988; 4:11\u20137.","journal-title":"Comput Appl Biosci"},{"key":"2228_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970; 48:443\u201353.","journal-title":"J Mol Biol"},{"key":"2228_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1981","unstructured":"Smith TF, Waterman MS. Identification of common molecular subsequences. J Mol Biol. 1981; 147:195\u20137.","journal-title":"J Mol Biol"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2228-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-018-2228-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2228-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T19:04:08Z","timestamp":1560539048000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2228-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,15]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2228"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2228-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2018,6,15]]},"assertion":[{"value":"14 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The author declares that he has no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"226"}}