{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:59Z","timestamp":1726410119751},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389047"},{"type":"electronic","value":"9783642389054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38905-4_7","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T23:28:54Z","timestamp":1368660534000},"page":"50-61","source":"Crossref","is-referenced-by-count":7,"title":["A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm"],"prefix":"10.1007","author":[{"given":"Gary","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yozen","family":"Hernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Loving","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(86)90091-8","volume":"23","author":"L. Allison","year":"1986","unstructured":"Allison, L., Dix, T.I.: A bit-string longest-common-subsequence algorithm. Information Processing Letters\u00a023(5), 305\u2013310 (1986)","journal-title":"Information Processing Letters"},{"issue":"01","key":"7_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1142\/S0129054102000947","volume":"13","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Hamel, S.: Vector algorithms for approximate string matching. International Journal of Foundations of Computer Science\u00a013(01), 53\u201365 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"6","key":"7_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters\u00a080(6), 279\u2013285 (2001)","journal-title":"Information Processing Letters"},{"unstructured":"Gelfand, Y., Loving, J., Hernandez, Y., Benson, G.: VNTRseek \u2013 A Computational Pipeline to Detect Tandem Repeat Variants in Next-Generation Sequencing Data: Analysis of the 454 Watson Genome. In: Proc. of RECOMB-seq: The Third Annual RECOMB Satellite Workshop on Massively Parallel Sequencing (to appear, 2013)","key":"7_CR4"},{"unstructured":"Hyyr\u00f6, H.: Bit-parallel LCS-length computation revisited. In: Proc. 15th Australasian Workshop on Combinatorial Algorithms, AWOCA 2004 (2004)","key":"7_CR5"},{"key":"7_CR6","first-page":"2","volume":"10","author":"H. Hyyr\u00f6","year":"2005","unstructured":"Hyyr\u00f6, H., Fredriksson, K., Navarro, G.: Increased bit-parallelism for approximate and multiple string matching. Journal of Experimental Algorithmics (JEA)\u00a010, 2\u20136 (2005)","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"unstructured":"Kernighan, B.W., Ritchie, D.M.: The C programming language, 2nd edn. Prentice Hall (1988)","key":"7_CR7"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM (JACM)\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"7_CR9","first-page":"356","volume":"11","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Approximate regular expression searching with arbitrary integer weights. Nordic Journal of Computing\u00a011(4), 356\u2013373 (2004)","journal-title":"Nordic Journal of Computing"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. Needleman","year":"1970","unstructured":"Needleman, S., Wunch, C.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol.\u00a048, 443\u2013453 (1970)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"issue":"10","key":"7_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching: allowing errors. Communications of the ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Communications of the ACM"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01942606","volume":"15","author":"S. Wu","year":"1996","unstructured":"Wu, S., Manber, U., Myers, G.: A subquadratic algorithm for approximate limited expression matching. Algorithmica\u00a015(1), 50\u201367 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38905-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T18:21:56Z","timestamp":1539368516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38905-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389047","9783642389054"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38905-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}