LongestCommonSubsequence class

The longest common subsequence (LCS) problem consists in finding the longest subsequence common to two (or more) sequences. It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences.

The LCS distance between Strings X (length n) and Y (length m) is n + m - 2 * |LCS(X, Y)| min = 0 max = n + m

LCS distance is equivalent to Levenshtein distance, when only insertion and deletion is allowed (no substitution), or when the cost of the substitution is the double of the cost of an insertion or deletion.

A space requirement O(m * n)!

Implemented types

• StringDistance
• NormalizedStringDistance

Constructors

LongestCommonSubsequence()

Properties

hashCode → int

The hash code for this object.

no setter, inherited

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

Methods

distance(String s1, String s2) → int

override

normalizedDistance(String s1, String s2) → double

Returns a similarity between 0.0 (exact same) and 1.0 (completely different).

override

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

toString() → String

A string representation of this object.

inherited

Operators

operator ==(Object other) → bool

The equality operator.

inherited