Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Does someone know how to find the longest common subsequence of a set of strings in Ocaml language?
Look at other questions tagged “lcs”, like Longest common subsequence of 3+ strings . Then you should be able to write the code in OCaml.