{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:50:44Z","timestamp":1761807044149,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/empdp.2003.1183610","type":"proceedings-article","created":{"date-parts":[[2004,2,3]],"date-time":"2004-02-03T14:24:01Z","timestamp":1075818241000},"page":"349-356","source":"Crossref","is-referenced-by-count":14,"title":["A coarse-grained multicomputer algorithm for the longest common subsequence problem"],"prefix":"10.1109","author":[{"given":"T.","family":"Garcia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-F.","family":"Myoupo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Seme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0022-0000(84)90025-4","article-title":"New Algorithms for the Longest Common Subsequence Problem","volume":"29","author":"du","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"ref11","first-page":"127","author":"dan\u00e4\u00edk","year":"1994","journal-title":"Proc 11th Annual Symp on Theoretical Aspects of Computer Science Caen France number 775 in Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1142\/S0129626499000384"},{"key":"ref13","article-title":"A Work-Optimal CGM Algorithm for the Longest Increasing Subsequence Problem","author":"garcia","year":"2001","journal-title":"International Conference n Parallel and Distributed Processing Techniques and Applications (PDPTA'01)"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/237502.237503"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/322033.322044"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/359581.359603"},{"key":"ref17","first-page":"171","article-title":"A Longest Algorithm Suitable for Similar Text String","volume":"18","author":"kayambayashi","year":"1982","journal-title":"Acta Informatica"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1006\/jpdc.2000.1659"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/S0020-0190(97)00011-2"},{"key":"ref4","first-page":"125","article-title":"Coarse Grained Parallel Maximum Matching in Convex Bipartite Graph","author":"bose","year":"1999","journal-title":"Proc 13th International Parallel Processing Symposium (IPPS'99)"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/0304-3975(92)90132-Y"},{"key":"ref6","first-page":"1","article-title":"Eicken, LogP: Towards a Realistic Model of Parallel Computation","author":"culler","year":"1996","journal-title":"8th ACM SIGPLAN Symp on Principles & Practice of Parallel Programming"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1142\/S0129626499000499"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/215399.215410"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1142\/S0218195996000241"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1137\/0219066"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1006\/jpdc.1998.1503"},{"key":"ref1","first-page":"1","article-title":"Bounds on the Complexity of the Longest Common Subsequence Problem","author":"aho","year":"1976","journal-title":"Journal of the ACM 23 1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/71.298210"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/0022-0000(80)90002-1"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1080\/01495739808947359"},{"key":"ref24","article-title":"Algorithmique Parallèle pour des Problèmes de Reconnaissance de Formes et de Motifs sur les Modèles Systolique et BSR","author":"sem\u00e9","year":"1999","journal-title":"Thèse de l'Université Picardie Jules Verne-Amiens"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/0020-0190(85)90058-4"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/79173.79181"},{"key":"ref25","first-page":"53","article-title":"Sequence Alignments","author":"waterman","year":"1985","journal-title":"Mathematical Methods for DNA Sequences"}],"event":{"name":"Proceedings Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing","start":{"date-parts":[[2003,2,5]]},"location":"Genova, Italy","end":{"date-parts":[[2003,2,7]]}},"container-title":["Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8434\/26558\/01183610.pdf?arnumber=1183610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T23:26:11Z","timestamp":1497569171000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1183610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/empdp.2003.1183610","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}