{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:17:55Z","timestamp":1725459475657},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045093","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"264-273","source":"Crossref","is-referenced-by-count":0,"title":["Fast algorithms for aligning sequences with restricted affine gap penalties"],"prefix":"10.1007","author":[{"given":"Kun-Mao","family":"Chao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., Gish, W., Miller, W., Myers, E. and Lipman, D. (1990) A basic local alignment search tool. J. Mol. Biol. 215, 403\u2013410.","journal-title":"J. Mol. Biol."},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/inco.1994.1007","volume":"108","author":"R. A. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R. A. and Gonnet, G. H. (1994) Fast string matching with mismatches. Information and Computation 108, 187\u2013199.","journal-title":"Information and Computation"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Chang, W. I. and Lampe, J. (1992) Theoretical and empirical comparisons of approximate string matching algorithms. Combinatorial Pattern Matching '92, Lecture Notes in Computer Science, 172\u2013181.","DOI":"10.1007\/3-540-56024-6_14"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-58094-8_3","volume":"807","author":"K.-M. Chao","year":"1994","unstructured":"Chao, K.-M. (1994) Computing all suboptimal alignments in linear space. Combinatorial Pattern Matching '94, Lecture Notes in Computer Science 807,31\u201342.","journal-title":"Combinatorial Pattern Matching '94, Lecture Notes in Computer Science"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01188583","volume":"13","author":"K.-M. Chao","year":"1995","unstructured":"Chao, K.-M. and Miller, W. (1995) Linear-space algorithms that build local alignments from fragments. Algorithmica 13, 106\u2013134.","journal-title":"Algorithmica"},{"key":"28_CR6","first-page":"147","volume":"11","author":"K.-M. Chao","year":"1995","unstructured":"Chao, K.-M., Zhang, J., Ostell, J. and Miller, W. (1995) A local alignment tool for very long DNA sequences. CABIOS 11, 147\u2013153.","journal-title":"CABIOS"},{"key":"28_CR7","first-page":"75","volume":"13","author":"K.-M. Chao","year":"1997","unstructured":"Chao, K.-M., Zhang, J., Ostell, J. and Miller, W. (1997) A tool for aligning very similar DNA sequences. CABIOS, 13, 75\u201380.","journal-title":"CABIOS"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gaasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W. and Rytter, W. (1994) Speeding up two string-matching algorithms. Algorithmica 12, 247\u2013267.","journal-title":"Algorithmica"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1126\/science.1379743","volume":"257","author":"D. L. Daniels","year":"1992","unstructured":"Daniels, D. L., Plunkett, G., Burland, V. and Blattner, F. R. (1992) Analysis of the Escherichia coli genome: DNA sequence of the region from 84.5 to 86.5 minutes. Science 257, 771\u2013778.","journal-title":"Science"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(95)00043-C","volume":"55","author":"A. Dermouche","year":"1995","unstructured":"Dermouche, A. (1995) A fast algorithm for string matching with mismatches. Information Processing Letters 55, 105\u2013110.","journal-title":"Information Processing Letters"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O. (1982) An improved algorithm for matching biological sequences. J. Mol. Biol. 162, 705\u2013708.","journal-title":"J. Mol. Biol."},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02458577","volume":"52","author":"O. Gotoh","year":"1990","unstructured":"Gotoh, O. (1990) Optimal sequence alignment allowing for long gaps. Bull. Math. Biol. 52, 359\u2013373.","journal-title":"Bull. Math. Biol."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/geno.1994.1275","volume":"21","author":"R. C. Hardison","year":"1994","unstructured":"Hardison, R. C., Chao, K.-M., Schwartz, S., Stojanovic, N., Ganetsky, M. and Miller, W. (1994) Globin Gene Server: a prototype E-mail database server featuring extensive multiple alignments and data compilation for electronic genetic analysis. Genomics 21, 344\u2013353.","journal-title":"Genomics"},{"key":"28_CR14","first-page":"227","volume":"10","author":"X. Huang","year":"1994","unstructured":"Huang, X. (1994) On global sequence alignment. CABIOS 10, 227\u2013235.","journal-title":"CABIOS"},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(92)90138-6","volume":"92","author":"J. Y. Kim","year":"1992","unstructured":"Kim, J. Y. and Shawe-Taylor, J. (1992) An approximate string-matching algorithm. Theo. Comp. Sci. 92, 107\u2013117.","journal-title":"Theo. Comp. Sci."},{"key":"28_CR16","first-page":"19","volume":"4","author":"G. M. Landau","year":"1988","unstructured":"Landau, G. M., Vishkin, U. and Nussinov, R. (1988) Locating alignments with k differences for nucleotide and amino acid sequences. CABIOS 4, 19\u201324.","journal-title":"CABIOS"},{"key":"28_CR17","unstructured":"Lewin, B. (1994) Genes V. Oxford University Press."},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E. W. Myers","year":"1986","unstructured":"Myers, E. W. (1986) An O(ND) difference algorithm and its variations. Algorithmica 1, 251\u2013266.","journal-title":"Algorithmica"},{"key":"28_CR19","first-page":"11","volume":"4","author":"E. W. Myers","year":"1988","unstructured":"Myers, E. W. and Miller, W. (1988) Optimal alignments in linear space. CABIOS 4,11\u201317.","journal-title":"CABIOS"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/59287.59290","volume":"11","author":"E. W. Myers","year":"1989","unstructured":"Myers, E. W. and Miller, W. (1989) Row replacement algorithms for screen editors. ACM Trans. Program. Lang. Syst. 11, 33\u201356.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"28_CR21","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. B. Needleman","year":"1970","unstructured":"Needleman, S. B. and Wunsch, C. D. (1970) A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol. 48,443\u2013453.","journal-title":"J. Mol. Biol."},{"key":"28_CR22","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W. R. Pearson","year":"1988","unstructured":"Pearson, W. R. and Lipman, D. (1988) Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. 85, 2444\u20132448.","journal-title":"Proc. Natl. Acad. Sci."},{"key":"28_CR23","doi-asserted-by":"crossref","first-page":"3391","DOI":"10.1093\/nar\/21.15.3391","volume":"21","author":"G. Plunkett","year":"1993","unstructured":"Plunkett, G., Burland, V., Daniels D. L. and Blattner, F. R. (1993) Analysis of the Escherichia coli genome.III. DNA sequence of the region from 87.2 to 89.2 minutes. Nucleic Acids Res 21, 3391\u20133398.","journal-title":"Nucleic Acids Res"},{"key":"28_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0076-6879(96)66012-1","volume":"266","author":"G.D. Schuler","year":"1996","unstructured":"Schuler, G.D., Epstein, J.A., Ohkawa, H., and Kans, J.A. (1996) Entrez: Molecular Biology Database and Retrieval System. Methods in Enzymol. 266, 141\u2013162.","journal-title":"Methods in Enzymol."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Sze, S.-H. and Pevzner, P. A. (1997) Las Vegas algorithms for gene recognition: suboptimal and error-tolerant spliced alignment. Proceedings of the First Annual International Conference on Computational Molecular Biology, 300\u2013309.","DOI":"10.1145\/267521.267889"},{"key":"28_CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E. (1992) Approximate string-matching with q-grams and maximal matches. Theo. Comp. Sci. 92, 191\u2013211.","journal-title":"Theo. Comp. Sci."},{"key":"28_CR27","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E. and Wood, D. (1993) Approximate string matching with suffix automata. Algorithmica 10, 353\u2013364.","journal-title":"Algorithmica"},{"key":"28_CR28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0022-5193(84)80037-5","volume":"108","author":"M. S. Waterman","year":"1984","unstructured":"Waterman, M. S. (1984) Efficient sequence alignment algorithms. J. theor. Biol. 108, 333\u2013337.","journal-title":"J. theor. Biol."},{"key":"28_CR29","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/0144038","volume":"44","author":"W. J. Wilbur","year":"1984","unstructured":"Wilbur, W. J. and Lipman, D. (1984) The context dependent comparison of biological sequences. SIAM J. Appl. Math. 44, 557\u2013567.","journal-title":"SIAM J. Appl. Math."},{"key":"28_CR30","first-page":"613","volume":"10","author":"Y Xu","year":"1994","unstructured":"Xu, Y, Mural, R. and Uberbacher, E. C. (1994) Constructing gene models from a set of accurately-predicted exons: an application of dynamic programming. CABIOS 10, 613\u2013623.","journal-title":"CABIOS"},{"key":"28_CR31","unstructured":"Zhang, J., Chao, K.-M., Florea, L. and Miller, W. (1997) Alignment Requirements for NCBI's Genomes Division. First Annual International Conference on Computational Molecular Biology, poster session."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T15:17:28Z","timestamp":1555427848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/bfb0045093","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}