string-algorithms

Here is 1 public repository matching this topic...

SoroushVahidi / parallel-longest-common-subsequence

It is a code in Chapel. Its input is 2 strings named string1 and string2, and it writes the lcs of them in O(log^3(n)) with O(mn) processors, such that m and n are the lengths of the input strings and n>=m.

parallel-computing string-algorithms chapel

Updated Feb 27, 2026
Chapel

Add this topic to your repo

To associate your repository with the string-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more