Lcs
The interface to classes that computes the longest common subsequence between two sequences of elements
The interface to classes that computes the longest common subsequence between two sequences of elements
- Authors
Lucas Satabin
Value members
Abstract methods
Computest the longest common subsequence between both input slices. Returns an ordered list containing the indices in the first sequence and in the second sequence.
Computest the longest common subsequence between both input slices. Returns an ordered list containing the indices in the first sequence and in the second sequence.
Concrete methods
Computes the longest commons subsequence between both inputs. Returns an ordered list containing the indices in the first sequence and in the second sequence.
Computes the longest commons subsequence between both inputs. Returns an ordered list containing the indices in the first sequence and in the second sequence.