Efficient Parallel Computing of a Longest Common Subsequence of Three Strings. - Guillaume Luce; Jean Frédéric Myoupo (PP, 1997)

A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. - Thierry Lecroq; Guillaume Luce; Jean Frédéric Myoupo (Inf. Process. Lett., 1997)

Systolic-based parallel architecture for the longest common subsequences problem. - Guillaume Luce; Jean Frédéric Myoupo (Integr., 1998)

Application-specific Array Processors for the Longest Common Subsequence Problem of Three Sequences. - Guillaume Luce; Jean Frédéric Myoupo (Parallel Algorithms Appl., 1998)