Longest Common Subsequence in Ocaml

Question

Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?

there is notihing ocaml-specific here, general algorithm question. — ygrek, Jun 27 '12 at 09:07
unfortunately I cannot answer with 'YES' as answers have to be at least 40 characters... — lambdapower, Jun 28 '12 at 05:53

score 1 · Accepted Answer · edited May 23 '17 at 12:20

1

Look at other questions tagged "lcs", like Longest common subsequence of 3+ strings . Then you should be able to write the code in OCaml.

edited May 23 '17 at 12:20

Community

answered Jun 27 '12 at 08:45

jrouquie

1 Answers1