A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin ≥ 2) in each of at least q ≥ 1 strings in a given set of strings. In this paper, we describe a family of efficient algorithms ...

The problem of finding the longest common subsequence (LCS) of two given strings A1 and A2 is a well-studied problem. The constrained longest common subsequence (C-LCS) for three strings A1, A2 and B1 is the longest common subsequence of A1 and A2 that contains B1 as a subsequence. The fastest algorithm solving the C-LCS problem has a time complexity of O(m1m2n1) where m1, m2 and n1 are the len...