The goal of the LAPCS problem is to determine the maximal length of the common subsequence of X and Y preserving all the arcs that link a subsequence of nucleotides. In this paper, we developed a fast heuristic algorithm for LAPCS in which the two types of arc-annotated sequence are ...
Longest common substringJump to: navigation, search Not to be confused with Longest common subsequence.The longest common substring (LCS) problem is the problem of finding a string of maximum length which is simultaneously a substring of two or more given strings (usually two). For example, the...
A parallel algorithm for the longest common subsequence problem on LARPBS is presented. For two sequences of lengths and , the algorithm uses processors and costs (/) computation time where 1 ≤≤ max{, }. Time-area cost of the algorithm is (/) and memory space required is (()/) ...
To the best of our knowledge this is the fastest \\((1-\\epsilon )\\) -approximation algorithm for all-substrings WLCS and WLCS in BSP. Further, this is the asymptotically fastest parallel algorithm for weighted LCS as the number of processors increases....
From this existing work, it is observed that, when this approach is applied to a case of three strings, this algorithm demonstrates the same performance as the fastest existing MLCS algorithm. When applied to more than three strings, this technique is significantly faster than the existing ...
Duraj, L.: A linear algorithm for 3-letter longest common weakly increasing subsequence. Inf. Process. Lett. 113(3), 94-99 (2013)Duraj, L. A linear algorithm for 3-letter longest common weakly increasing subsequence. Information Processing Letters 113, 3 (2013), 94 - 99....