Class

A Partial MoreStructures.SuffixArrays.SuffixArray which only contains the indexes of the Suffix Array which are multiple of a given constant (0, k, 2k, ...), indexed by their position in the complete Suffix Array.

Inheritance
System.Object
Implements
System.IEquatable<MoreStructures.SuffixArrays.>
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: MoreStructures.SuffixArrays
Assembly: MoreStructures.dll
Syntax
public class  : IEquatable<>
Remarks

MoreStructures.SuffixArrays.SuffixArray is a space-efficient alternative to SuffixTreeNode structures, due to their Θ(n) with c=1 space used, when the size of an index can be considered constant w.r.t. the size of the input strings.
There are, however, cases where even the linear Space Complexity of a MoreStructures.SuffixArrays.SuffixArray is considered still too high, and a smaller data structure has to be stored, potentially at the cost of the algorithm runtime.
These are the scenarios where a Partial Suffix Array is used.
Text pattern matching with Suffix Arrays can also be done with partial structures, for example by using the Last-First property of the Burrows-Wheeler Transform and its sorted version.

Implements

System.IEquatable<T>

Extension Methods