Jean Frédéric Myoupo and David Semé: Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. (1999)journals/jpdc/MyoupoS9910.1006/JPDC.1999.1534Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems.2Jean Frédéric Myoupo1David Semé2212-223J. Parallel Distributed Comput.J. Parallel Distributed Comput.5721999provenance information for RDF data of dblp record 'journals/jpdc/MyoupoS99'2020-02-22T19:35:22+0100