| Function longestCommonSubsequence Computes the longest common subsequence. longestCommonSubsequence(str1, str2, pos) Parameters
str1 | In-parameter: An arbitrary string. Types: String
str2 | In-parameter: An arbitrary string. Types: String
pos | Out-parameter: A String with pairs of positions that indicate the longest common subsequence. Remarks: The last pair of positions in pos indicates the first pair in the longest common subsequence. That's why pos should be a Block-String (Stack).
Example Programs Longest Common Subsequence SeqAn - Sequence Analysis Library - www.seqan.de