乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T06:06:28Z","timestamp":1709791588866},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0743-7315(03)00010-8","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T18:05:06Z","timestamp":1053367506000},"page":"264-272","source":"Crossref","is-referenced-by-count":55,"title":["Parallel biological sequence comparison using prefix computations"],"prefix":"10.1016","volume":"63","author":[{"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[]},{"given":"Natsuhiko","family":"Futamura","sequence":"additional","affiliation":[]},{"given":"Kishan","family":"Mehrotra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0743-7315(03)00010-8_BIB1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","article-title":"Efficient parallel algorithms for string editing and related problems","volume":"19","author":"Apostlico","year":"1990","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0743-7315(03)00010-8_BIB2","unstructured":"M.O. Dayhoff, R. Schwartz, B.C. Orcutt, A model of evolutionary change in proteins: matrices for detecting distant relationships, in: M.O. Dayhoff (Ed.), Atlas of Protein Sequence and Structure, Vol. 5, National Biomedical Research Foundation, DC, 1978, pp. 345\u2013358."},{"issue":"3","key":"10.1016\/S0743-7315(03)00010-8_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02427852","article-title":"Parallel processing of biological sequence comparison algorithms","volume":"17","author":"Edmiston","year":"1988","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0743-7315(03)00010-8_BIB4","unstructured":"E.W. Edmiston, R.A. Wagner, Parallelization of the dynamic programming algorithm for comparison of sequences, Proceedings of the International Conference on Parallel Processing, 1987, pp. 78\u201380."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","article-title":"An improved algorithm for matching biological sequences","volume":"162","author":"Gotoh","year":"1982","journal-title":"J. Molec. Biol."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB6","doi-asserted-by":"crossref","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","article-title":"Amino acid substitution matrices from protein blocks","volume":"89","author":"Henikoff","year":"1992","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"6","key":"10.1016\/S0743-7315(03)00010-8_BIB7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/S0743-7315(03)00010-8_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01407900","article-title":"A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor","volume":"18","author":"Huang","year":"1989","journal-title":"Internat. J. Parallel Programming"},{"issue":"4","key":"10.1016\/S0743-7315(03)00010-8_BIB9","first-page":"373","article-title":"A space-efficient algorithm for local similarities","volume":"6","author":"Huaug","year":"1990","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB10","series-title":"Introduction to Parallel Computing","author":"Kumar","year":"1994"},{"key":"10.1016\/S0743-7315(03)00010-8_BIB11","unstructured":"E. Lander, J.P. Mesirov, W. Taylor, Protein sequence comparison on a data parallel computer, Proceedings of the International Conference on Parallel Processing, 1988, pp. 257\u2013263."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm for computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0743-7315(03)00010-8_BIB13","first-page":"11","article-title":"Optimal alignments in linear space","volume":"4","author":"Mayers","year":"1988","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB14","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Molec. Biol."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0743-7315(90)90125-9","article-title":"String editing on an SIMD hypercube multicomputer","volume":"9","author":"Ranka","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0743-7315(03)00010-8_BIB16","series-title":"Introduction to Computational Molecular Biology","author":"Setubal","year":"1997"},{"key":"10.1016\/S0743-7315(03)00010-8_BIB17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Molec. Biol."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:25:26Z","timestamp":1553203526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503000108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0743731503000108"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00010-8","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}