Concepts inOn the sorting-complexity of suffix tree construction
Suffix tree
In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations. The suffix tree for a string is a tree whose edges are labeled with strings, such that each suffix of corresponds to exactly one path from the tree's root to a leaf.
more from Wikipedia
Comparison sort
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or equal to" operator) that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator obey two of the properties of a total order: if a ¿ b and b ¿ c then a ¿ c (transitivity) for all a and b, either a ¿ b or b ¿ a.
more from Wikipedia
Sorting algorithm
In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms that require sorted lists to work correctly; it is also often useful for canonicalizing data and for producing human-readable output.
more from Wikipedia
Alphabet
An alphabet is a standard set of letters which is used to write one or more languages based on the general principle that the letters represent phonemes (basic significant sounds) of the spoken language. This is in contrast to other types of writing systems, such as logographies, in which each character represents a word, morpheme or semantic unit, and syllabaries, in which each character represents a syllable. A true alphabet has letters for the vowels of a language as well as the consonants.
more from Wikipedia
Open problem
In science and mathematics, an open problem or an open question is a known problem that can be accurately stated, and has not yet been solved (no solution for it is known). Some questions remain unanswered for centuries before solutions are found. Two notable examples in mathematics that have been solved and closed by researchers in the late twentieth century are Fermat's Last Theorem and the four color map theorem.
more from Wikipedia
Pattern matching
In computer science, pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact. The patterns generally have the form of either sequences or tree structures.
more from Wikipedia
String (computer science)
In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set called an alphabet. In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and/or the length changed, or it may be fixed (after creation).
more from Wikipedia
N
N is the fourteenth letter in the ISO basic Latin alphabet.
more from Wikipedia