{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:28Z","timestamp":1725516208657},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693833"},{"type":"electronic","value":"9783540693840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_94","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:39:15Z","timestamp":1217471955000},"page":"893-902","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space"],"prefix":"10.1007","author":[{"given":"Vamsi","family":"Kundeti","sequence":"first","affiliation":[]},{"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"94_CR1","first-page":"487","volume":"194","author":"V.L. Arlazarov","year":"1970","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic con- struction of the transitive closure of a directed graph. Dokl. Akad. Nauk SSSR\u00a0194, 487\u2013488 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"6","key":"94_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: Linear space algorithm for computing maximal common subsequences. Communications of the ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Communications of the ACM"},{"key":"94_CR3","unstructured":"Horowitz, E., Sahni, S., Rajasekaran, S.: Computer Algorithms. Silicon Press (2008)"},{"issue":"3","key":"94_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology\u00a048(3), 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"issue":"1","key":"94_CR5","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":"3","key":"94_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0022-5193(86)80112-6","volume":"121","author":"O. Gotoh","year":"1986","unstructured":"Gotoh, O.: Alignment of three biological sequences with an efficient traceback procedure. Journal of Theoretical Biology\u00a0121(3), 327\u2013337 (1986)","journal-title":"Journal of Theoretical Biology"},{"issue":"4","key":"94_CR7","first-page":"373","volume":"6","author":"X. Huang","year":"1990","unstructured":"Huang, X., Hardison, R.C., Miller, W.: A space-efficient algorithm for local similarities. Computer Applications in the Biosciences\u00a06(4), 373\u2013381 (1990)","journal-title":"Computer Applications in the Biosciences"},{"issue":"1","key":"94_CR8","first-page":"17","volume":"3","author":"O. Gotoh","year":"1987","unstructured":"Gotoh, O.: Pattern matching of biological sequences with limited storage. Computer Applications in the Biosciences\u00a03(1), 17\u201320 (1987)","journal-title":"Computer Applications in the Biosciences"},{"issue":"1","key":"94_CR9","first-page":"11","volume":"4","author":"E.W. Myers","year":"1988","unstructured":"Myers, E.W., Miller, W.: Optimal alignments in linear space. Computer Applications in the Biosciences\u00a04(1), 11\u201317 (1988)","journal-title":"Computer Applications in the Biosciences"},{"key":"94_CR10","unstructured":"Edmiston, E., Wagner, R.A.: Parallelization of the dynamic programming algorithm for comparison of sequences, pp. 78\u201380 (1987)"},{"issue":"4","key":"94_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0743-7315(90)90125-9","volume":"9","author":"S. Ranka","year":"1990","unstructured":"Ranka, S., Sahni, S.: String editing on an simd hypercube multicomputer. Journal of Parallel and Distributed Computing\u00a09(4), 411\u2013418 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"12","key":"94_CR12","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1109\/TPDS.2004.86","volume":"15","author":"S. Rajko","year":"2004","unstructured":"Rajko, S., Aluru, S.: Space and time optimal parallel sequence alignments. IEEE Transactions on Parallel and Distributed Systems\u00a015(12), 1070\u20131081 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"94_CR13","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms of Strings Trees and Sequences. Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T05:51:46Z","timestamp":1551505906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}