LongestCommonSubstringBaseA (FsODE)

FsODE

Documentation for 0.0.2

LongestCommonSubstringBaseA Type

Namespace: Altaxo.Collections.Text
Assembly: AltaxoCore.Redist.dll
Base Type: LongestCommonSubstringBase

Base class for problem solvers for longest common substring problems using an array of linked structures stored in a linear array instead of linked class instances. This should it make easier for the garbage collector.

For details of the algorithm see the very nice paper by Michael Arnold and Enno Ohlebusch, 'Linear Time Algorithms for Generalizations of the Longest Common Substring Problem', Algorithmica (2011) 60; 806-818; DOI: 10.1007/s00453-009-9369-1. This code was adopted from the C++ sources from the web site of the authors at http://www.uni-ulm.de/in/theo/research/sequana.html.

Constructors

Constructor	Description
`LongestCommonSubstringBaseA(gsa)` Full Usage: `LongestCommonSubstringBaseA(gsa)` Parameters: gsa : `GeneralizedSuffixArray` - Generalized suffix array. It is neccessary that this was constructed with individual words.	Initializes a new instance of the problem solver for the longest common substring problem. gsa : `GeneralizedSuffixArray` Generalized suffix array. It is neccessary that this was constructed with individual words.