An opaque reference to a suffix tree for string matching

Description

This class is used to represent a reference to a C-level data structure that is a suffix tree. Suffix trees are used to represent strings in ways that make performing substring comparisons efficient.

Objects from the Class

The preferred way to construct objects of this class is via the SuffixTree-methods which accept either a StringSet-class or a character vector giving the collection of strings. The latter is merely a convenience function for the former.

Slots

ref:

Object of class "externalptr". This is a reference to the opaque C-level data structure from the libstree library.

Methods

No methods defined with class "SuffixTree" in the signature.

Author(s)

Duncan Temple Lang <duncan@wald.ucdavis.edu>

References

http://www.cl.cam.ac.uk/~cpk25/libstree/{libstree} http://www.omegahat.org/Rlibstree

See Also

SuffixTree-methods

Examples

words = c("stemming", "boing", "springs")
tree = SuffixTree(words)

getLongestSubstring(tree, c(1, 0))