{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:49:11Z","timestamp":1725504551664},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387772509"},{"type":"electronic","value":"9780387772516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-77251-6_8","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T23:38:32Z","timestamp":1203982712000},"page":"61-69","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Longest Common Subsequence Algorithm for Biosequences Alignment"],"prefix":"10.1007","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal and J. Park, 1988, Notes on Searching in Multidimensional Monotone Arrays, Proc. 29th Ann. IEEE Symp. Foundations of Comput. Sci. pp. 497-512.","DOI":"10.1109\/SFCS.1988.21966"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. Aho","year":"1976","unstructured":"A. Aho, D. Hirschberg, and J. Ullman, 1976, Bounds on the Complexity of the Longest Common Subsequence Problem, J. Assoc. Comput. Mach., Vol. 23, No. 1, 1976, pp. 1-12.","journal-title":"J. Assoc. Comput. Mach"},{"key":"8_CR3","first-page":"968","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M. Atallah, L. Larmore, and S. Mcfaddin, 1990, Efficient Parallel Algorithms for String Editing and Related Problems, SIAM J. Computing, Vol. 19, pp. 968-988.","journal-title":"Computing"},{"key":"8_CR4","unstructured":"Bailin Hao, Shuyu Zhang, 2000, The manual of Bioinformatics, Shanghai science and technology publishing company."},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"D.S. Hirschberg, 1975, A Linear Space Algorithm for Computing Maximal Common Subsequences, Commun. ACM, Vol. 18, No. 6, pp. 341-343.","journal-title":"Commun. ACM"},{"issue":"1","key":"8_CR6","first-page":"11","volume":"4","author":"E.W. Mayers","year":"1998","unstructured":"E.W. Mayers, W. Miller, 1998, Optimal Alignment in Linear Space, Comput. Appl. Biosci. Vol. 4, No. 1, pp. 11-17.","journal-title":"Comput. Appl. Biosci"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02427852","volume":"17","author":"E.W. Edmiston","year":"1988","unstructured":"Edmiston E.W., Core N.G., Saltz J.H, et al., 1988, Parallel processing of biological sequence comparison algorithms. International Journal of Parallel Programming, Vol. 17, No. 3, pp. 259-275.","journal-title":"International Journal of Parallel Programming"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jpdc.1999.1534","volume":"57","author":"Jean Fr\u00e9d\u00e9ric Myoupo","year":"1999","unstructured":"Jean Fr\u00e9d\u00e9ric Myoupo, David Seme, 1999, Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems, Journal of Parallel and Distributed Computing, Vol. 57, No. 2, pp. 212-223.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"8_CR9","unstructured":"K. Nandan Babu, Wipro Systems, and Sanjeev Saxena, 1997, Parallel Algorithms for the Longest Common Subsequence Problem, 4th International Conference on High Performance Computing, December 18-21, 1997 - Bangalore, India."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"L. Bergroth, H. Hakonen, and T. Raita, 2000, A survey of longest common subsequence algorithms, Seventh International Symposium on String Processing Information Retrieval, pp. 39-48.","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"3","key":"8_CR11","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. and Wunsch, C.D., 1970, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Biol., Vol. 48, No. 3, pp. 443-453.","journal-title":"J. Mol. Biol."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"O. Gotoh, 1982, An improved algorithm for matching biological sequences, J. Molec. Biol. Vol. 162, pp. 705-708.","journal-title":"J. Molec. Biol"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"T.F. Smith","year":"1990","unstructured":"Smith T.F., Waterman M.S. 1990, Identification of common molecular subsequence. Journal of Molecular Biology, Vol. 215, pp. 403-410.","journal-title":"Journal of Molecular Biology"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2004.02.011","volume":"90","author":"V. Freschi","year":"2004","unstructured":"V. Freschi and A. Bogliolo, 2004, Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism, Information Processing Letters, Vol. 90, No. 4, pp. 167-173.","journal-title":"Information Processing Letters"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0020-0255(97)10013-5","volume":"106","author":"Y. Pan","year":"1998","unstructured":"Y. Pan, K. Li, 1998, Linear Array with a Reconfigurable Pipelined Bus System - Concepts and Applications, Journal of Information Science, Vol. 106, pp. 237-258.","journal-title":"Journal of Information Science"}],"container-title":["The International Federation for Information Processing","Computer And Computing Technologies In Agriculture, Volume I"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-77251-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T04:13:23Z","timestamp":1619669603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-77251-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387772509","9780387772516"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-77251-6_8","relation":{},"subject":[]}}