{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:41:29Z","timestamp":1725550889312},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305064"},{"type":"electronic","value":"9783540324201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590316_101","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T15:18:20Z","timestamp":1133882300000},"page":"636-639","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Sequence Alignment: A Lookahead Approach"],"prefix":"10.1007","author":[{"given":"Prasanta K.","family":"Jana","sequence":"first","affiliation":[]},{"given":"Nikesh","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"101_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01407900","volume":"18","author":"X. Huang","year":"1989","unstructured":"Huang, X.: A space efficient parallel sequence comparison algorithm for mes-sage-passing multiprocessors. International J. of Parallel Programming.\u00a018, 223\u2013239 (1989)","journal-title":"International J. of Parallel Programming."},{"key":"101_CR2","unstructured":"Lander, E., Mesirov, J., Taylor, W.: Protein sequence comparison on a data parallel com-puter. In: Proceedings of the 1988 International Conference on Parallel Processing, pp. 257\u2013263 (1988)"},{"key":"101_CR3","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/S0743-7315(03)00010-8","volume":"63","author":"S. Aluru","year":"2003","unstructured":"Aluru, S., Futamura, N., Mehrotra, K.: Parallel biological sequence comparison using pre-fix computations. J. of Parallel and Distributed Computing\u00a063, 264\u2013272 (2003)","journal-title":"J. of Parallel and Distributed Computing"},{"key":"101_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02427852","volume":"17","author":"E. Edmiston","year":"1988","unstructured":"Edmiston, E., Core, N., Saltz, J., Smith, R.: Parallel processing of biological sequence comparison algorithms. International J. of Parallel Programming\u00a017, 259\u2013275 (1988)","journal-title":"International J. of Parallel Programming"},{"key":"101_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. J. of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"J. of Molecular Biology"},{"key":"101_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings Trees and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings Trees and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"101_CR7","doi-asserted-by":"crossref","unstructured":"Bokhari, S.H., Saurer, J.R.: Sequence alignment on the Cray MTA-2. In: Proceedings of Second IEEE International Workshop on High Performance Computational Biology, Nice, France, April 22 (2003)","DOI":"10.1109\/IPDPS.2003.1213285"},{"key":"101_CR8","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Schroder, H., Schimmler, M.: Massively Parallel Solutions for Molecular Se-quence Analysis. In: Proceedings of 1st International workshop on High Performance Computational Biology (2002)","DOI":"10.1109\/IPDPS.2002.1016589"},{"key":"101_CR9","doi-asserted-by":"crossref","unstructured":"Martins, W.S., del Cuvillo, J., Cui, W., Gao, G.: Whole genome alignment using a multi-threaded parallel implementation. In: Proceedings of Symposium on Computer Architecture and High Performance Computing, Pirenopolis, Brazil, pp. 1\u20138 (2001)","DOI":"10.5753\/sbac-pad.2001.22185"},{"key":"101_CR10","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM\u00a024, 664\u2013675 (1977)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590316_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T20:01:44Z","timestamp":1683316904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590316_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305064","9783540324201"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11590316_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}