Search Results for author:
Found 1 papers, 0 papers with code
A Fast Randomized Algorithm for Finding the Maximal Common Subsequences
A well-known result states that finding a Longest Common Subsequence (LCS) for $L$ strings is NP-hard, e. g., the computational complexity is exponential in $L$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
