{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:07:14Z","timestamp":1735016834135,"version":"3.32.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s11227-005-0158-6","type":"journal-article","created":{"date-parts":[[2005,2,15]],"date-time":"2005-02-15T11:06:46Z","timestamp":1108465606000},"page":"51-69","source":"Crossref","is-referenced-by-count":3,"title":["New Processor Array Architectures for the Longest Common Subsequence Problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Panagiotis D.","family":"Michailidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos G.","family":"Margaritis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho, D. S. Hirschberg, and J. D. Ullman Bounds on the complexity of the longest common subsequence problem. Journal of Association Computing Machineny, 23:1?12, 1976.","journal-title":"Journal of Association Computing Machineny"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M. Attalah, L. Larmore, and S. Mcfaddin Efficient parallel algorithms for string editing and related problems. SIAM Journal on Computing, 19:968?988, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"L. Bergroth, H. Hakonen, and T. Raita A survey of longest common subsequence algorithms. In 7th International Symposium on String Processing and Information Retrieval, pp. 39?48, 2000.","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"CR4","unstructured":"M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, and J. R. Reid A fastand practical bit-vector algorithm for the longest common subsequence problem. In 11th Australasian Workshop on Combinatorial Algorithms, pp. 75?86, 2000."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, and J. R. Reid A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters, 80:279?285, 2001.","journal-title":"Information Processing Letters"},{"key":"CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Gambridge, England, 1997."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. S. Hirschberg","year":"1975","unstructured":"D. S. Hirschberg A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18:341?343, 1975.","journal-title":"Communications of the ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0020-0190(78)90037-6","volume":"7","author":"D. S. Hirschberg","year":"1978","unstructured":"D. S. Hirschberg An information theoretic lower bound for the longest common subsequence problem. Information Processing Letters, 7:40?41, 1978.","journal-title":"Information Processing Letters"},{"key":"CR9","first-page":"473","volume":"12","author":"R. Hughey","year":"1996","unstructured":"R. Hughey Parallel hardware for sequence comparison and alignment. CABIOS, 12:473?479, 1996.","journal-title":"CABIOS"},{"key":"CR10","unstructured":"S. Y. Kung VLSI Array Processors. Prentice-Hall, 1988."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0020-0190(97)00011-2","volume":"61","author":"T. Lecroq","year":"1997","unstructured":"T. Lecroq, G. Luce, and J. F. Myoupo A faster linear systolic algorithm for recovering a longest common subsequence. Information Processing Letters, 61:129?136, 1997.","journal-title":"Information Processing Letters"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1142\/S012962649800050X","volume":"8","author":"T. Lecroq","year":"1998","unstructured":"T. Lecroq, J. F. Myoupo, and D. Seme A one-phase parallel algorithm for the sequence alignment problem. Parallel Processing Letters, 8:515?526, 1998.","journal-title":"Parallel Processing Letters"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1016\/0167-8191(94)90040-X","volume":"20","author":"Y.-C. Lin","year":"1994","unstructured":"Y.-C. Lin New systolic arrays for the longest common subsequence problem. Parallel Computing, 20:1323?1334, 1994.","journal-title":"Parallel Computing"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1008087824437","volume":"12","author":"Y.-C. Lin","year":"1998","unstructured":"Y.-C. Lin and J.-C. Chen An efficient systolic algorithm for the longest common subsequence problem. The Journal of Supercomputing, 12:373?385, 1998.","journal-title":"The Journal of Supercomputing"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1080\/02533839.2000.9670581","volume":"23","author":"Y.-C. Lin","year":"2000","unstructured":"Y.-C. Lin and J.-C. Chen Another efficient systolic algorithm for the longest common subsequence problem. Journal of the Chinese Institute of Engineers, 23:607?613, 2000.","journal-title":"Journal of the Chinese Institute of Engineers"},{"key":"CR16","first-page":"519","volume":"18","author":"Y.-C. Lin","year":"2002","unstructured":"Y.-C. Lin and J.-W. Yeh A scalable and efficient systolic algorithm for the longest common subsequence problem. Journal of Information Science and Engineering, 18:519?532, 2002.","journal-title":"Journal of Information Science and Engineering"},{"key":"CR17","unstructured":"Y.-C. Lin and J.-W. Yeh Deriving a systolic algorithm for the LCS problem. International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1890?1897, 1998."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10637190208941431","volume":"17","author":"Y.-C. Lin","year":"2002","unstructured":"Y.-C. Lin and J.-W. Yeh Deriving a fast systolic algorithm for the longest common subsequence problem. Parallel Algorithms and Applications, 17:1?18, 2002.","journal-title":"Parallel Algorithms and Applications"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-9260(98)00003-0","volume":"25","author":"G. Luce","year":"1998","unstructured":"G. Luce and J. F. Myoupo Systolic-based parallel architecture for the longest common subsequences problem. Integration, the VLSI Journal, 25:53?70, 1998.","journal-title":"Integration, the VLSI Journal"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/71.298210","volume":"5","author":"M. Lu","year":"1994","unstructured":"M. Lu and H. Lin Parallel algorithms for the longest common subsequence problem. IEEE Transactions on Parallel and Distributed Systems, 5:835?848, 1994.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/10637199708915586","volume":"11","author":"K. G. Margaritis","year":"1997","unstructured":"K. G. Margaritis and D. J. Evans A VLSI processor array for flexible string matching. Parallel Algorithms and Applications, 11:45?60, 1997.","journal-title":"Parallel Algorithms and Applications"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. J. Masek","year":"1980","unstructured":"W. J. Masek and M. S. Paterson A faster algorithm computing string edit distances. Journal of Computer System Sciences, 20:18?31, 1980.","journal-title":"Journal of Computer System Sciences"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"J. H. Moreno and T. Lang Matrix Computations on Systolic-Type Arrays. Kluwer Academic Publishers, 1992.","DOI":"10.1007\/978-1-4615-3610-9"},{"key":"CR24","unstructured":"N. Petkov Systolic Parallel Processing. Elsevier Science Publishers, 1993."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1142\/S0218001494000425","volume":"8","author":"N. Ranganathan","year":"1994","unstructured":"N. Ranganathan and R. Sastry VLSI architectures for pattern matching. International Journal of Pattern Recognition and Artificial Intelligence, 8:815?843, 1994.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(85)90058-4","volume":"21","author":"Y. Robert","year":"1985","unstructured":"Y. Robert and M. Tchuente A systolic array for the longest common subsequence problem. Information Processing Letters, 21:191?198, 1985.","journal-title":"Information Processing Letters"},{"key":"CR27","unstructured":"D. Sankoff and J.B. Kruskal Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983."},{"key":"CR28","unstructured":"J. Setubal and J. Meidanis Introduction to Computational Molecular Biology. PWS, Boston, MA, 1997."},{"key":"CR29","volume-title":"MPI: The Complete Reference","author":"M. Snir","year":"1996","unstructured":"M. Snir, S. Otto, S. Huss-Lederman, D. W. Walker and J. Dongarra MPI: The Complete Reference. The MIT Press, Cambridge, Massachusetts, 1996."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1080\/02533839.1987.9677028","volume":"10","author":"C.-B. Yang","year":"1987","unstructured":"C.-B. Yang and R. C. T. Lee Systolic algorithms for the longest common subsequence problem. Journal of the Chinese Institute of Engineers, 10:691?699, 1987.","journal-title":"Journal of the Chinese Institute of Engineers"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-005-0158-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-005-0158-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-005-0158-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T09:54:08Z","timestamp":1734947648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-005-0158-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["158"],"URL":"https:\/\/doi.org\/10.1007\/s11227-005-0158-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}