Information | |
---|---|
has gloss | eng: A substring index is a data structure which gives substring search in a text or text collection in sublinear time. If you have a document S of length n, or a set of documents D=\S^1,S^2, \dots, S^d\} of total length n, you can locate all occurrences of a pattern P in o(n) time. (o(n) means less than O(n). See Big O notation.) |
lexicalization | eng: Substring index |
instance of | c/Algorithms on strings |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint