• Thumbnail for Generalized suffix tree
    In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings D = S 1 , S 2 , … , S d {\displaystyle D=S_{1}...
    3 KB (386 words) - 12:55, 1 April 2025
  • Thumbnail for Suffix tree
    computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text...
    29 KB (3,710 words) - 22:18, 27 April 2025
  • A generalized suffix array can be generated for a generalized suffix tree. When compared to a generalized suffix tree, while the generalized suffix array...
    7 KB (1,058 words) - 23:44, 17 November 2023
  • time with a generalized suffix tree. The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings...
    8 KB (1,072 words) - 16:32, 25 May 2025
  • Thumbnail for Suffix automaton
    that Weiner's 1973 suffix-tree construction algorithm while building a suffix tree of the string S {\displaystyle S} constructs a suffix automaton of the...
    55 KB (8,334 words) - 06:31, 14 April 2025
  • (Singapore) Generation-skipping transfer tax, in the United States Generalized suffix tree GeSbTe, a phase-change material GST Computer Systems, a group of...
    2 KB (306 words) - 22:38, 21 June 2025
  • Thumbnail for Rope (data structure)
    Rope (data structure) (category Binary trees)
    binary tree where each leaf (end node) holds a string of manageable size and length (also known as a weight), and each node further up the tree holds the...
    16 KB (1,787 words) - 10:55, 12 May 2025
  • include: The suffix tree, a radix tree of the suffixes of the string, allowing substring search to be performed symbol-by-symbol The suffix automaton, the...
    5 KB (611 words) - 08:19, 10 January 2025
  • | Tree (Black, Tree (Red, a, x, Tree (Red, b, y, c)), z, d) | Tree (Black, a, x, Tree (Red, Tree (Red, b, y, c), z, d)) | Tree (Black, a, x, Tree (Red...
    28 KB (3,292 words) - 08:36, 25 June 2025
  • output suffix array. Enhanced suffix arrays (ESAs) are suffix arrays with additional tables that reproduce the full functionality of suffix trees preserving...
    29 KB (3,775 words) - 11:06, 23 April 2025
  • size is generally exponential in the input automaton). NFAs have been generalized in multiple ways, e.g., nondeterministic finite automata with ε-moves...
    29 KB (4,498 words) - 11:45, 27 July 2025
  • a compact notation for regular grammars Regular tree grammar, a generalization from strings to trees Prefix grammar Chomsky hierarchy Hidden Markov model...
    8 KB (988 words) - 21:36, 23 September 2024
  • Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search tree Trie Other...
    9 KB (1,104 words) - 19:42, 10 June 2025
  • Thumbnail for Longest common subsequence
    Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search tree Trie Other...
    35 KB (4,355 words) - 22:13, 6 April 2025
  • has no left or right children. This would represent a unique suffix in the ternary tree corresponding to the key string. If there is no such path, this...
    14 KB (1,784 words) - 21:43, 13 November 2024
  • Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search tree Trie Other...
    4 KB (510 words) - 23:18, 19 December 2023
  • "00000", ... }. The upper right part shows the logical structure (syntax tree) of the expression, with "." denoting concatenation (assumed to have variable...
    14 KB (1,221 words) - 06:31, 14 April 2025
  • Thumbnail for Wavelet Tree
    Originally introduced to represent compressed suffix arrays, it has found application in several contexts. The tree is defined by recursively partitioning the...
    5 KB (681 words) - 13:09, 9 August 2023
  • thus O(mn). In actuality though MUMs are identified by building a generalized suffix tree for A and B . A list is then created for all internal nodes with...
    7 KB (779 words) - 23:31, 29 July 2025
  • Algorithms on Strings, Trees, and Sequences (1 ed.), Cambridge University Press, pp. 19–21, ISBN 0-521-58519-8 "Constructing a Good Suffix Table - Understanding...
    23 KB (2,824 words) - 11:46, 27 July 2025
  • index, for example a suffix tree or suffix array, the occurrences of a pattern can be found quickly. As an example, a suffix tree can be built in Θ ( n...
    21 KB (2,341 words) - 17:09, 26 July 2025
  • Slavic languages in general) are formed by adding possessive and other suffixes to given names, place names, professions and other words. Surnames were...
    13 KB (993 words) - 14:44, 7 July 2025
  • the factitives in the present, generalizing the alternation to the statives as well, and borrowing *-ai- as the past suffix. Old Norse for the most part...
    60 KB (5,129 words) - 11:40, 24 July 2025
  • The English suffixes -phobia, -phobic, -phobe (from Greek φόβος phobos, "fear") occur in technical usage in psychiatry to construct words that describe...
    43 KB (2,474 words) - 19:21, 3 August 2025
  • Thumbnail for Cartesian tree
    Guy E. (2014), "A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction", ACM Transactions on Parallel Computing...
    32 KB (4,294 words) - 21:45, 11 July 2025
  • times, however, this system was breaking down. *-eh₂ became generalized as the feminine suffix, and eh₂-stem nouns evolved more and more in the direction...
    74 KB (5,616 words) - 07:50, 9 July 2025
  • Thumbnail for Geʽez
    suffix /-a/: ተከለ takal-a plant-3.M.SG ብእሲ bəʾsi man ዕፀ ʿəḍ-a tree-ACC ተከለ ብእሲ ዕፀ takal-a bəʾsi ʿəḍ-a plant-3.M.SG man tree-ACC The man planted a tree...
    68 KB (5,862 words) - 11:16, 15 July 2025
  • A GLR parser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous...
    7 KB (853 words) - 19:21, 9 June 2025
  • Therefore, it is a basic method to solve other alignment problems. Generalized tree alignment Elias, Isaac (2006), "Settling the intractability of multiple...
    16 KB (2,312 words) - 08:55, 27 May 2025
  • Thumbnail for Tocharian languages
    VII) with suffix ñ < PIE -n- (palatalized by thematic e, with palatalized variant generalized). Varying subjunctives: i: Athematic without suffix, with root...
    77 KB (7,459 words) - 16:17, 19 May 2025