enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Suffix tree - Wikipedia

   en.wikipedia.org/wiki/Suffix_tree

   In 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 as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations.

3. Trie - Wikipedia

   en.wikipedia.org/wiki/Trie

   In computer science, a trie (/ ˈ t r aɪ /, / ˈ t r iː /), also known as a digital tree or prefix tree, [1] is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store their associated key.

4. LCP array - Wikipedia

   en.wikipedia.org/wiki/LCP_array

   suffix tree traversal using the suffix links. Kasai et al. (2001) show how to simulate a bottom-up traversal of the suffix tree using only the suffix array and LCP array. Abouelhoda, Kurtz & Ohlebusch (2004) enhance the suffix array with the LCP array and additional data structures and describe how this enhanced suffix array can be used to ...

5. Ukkonen's algorithm - Wikipedia

   en.wikipedia.org/wiki/Ukkonen's_algorithm

   You can find the following characteristics in a suffix tree that uses Ukkonen's algorithm: Implicit suffix tree T i+1 is built on top of implicit suffix tree T i. At any given time, Ukkonen's algorithm builds the suffix tree for the characters seen so far and so it has on-line property, allowing the algorithm to have an execution time of O(n).

6. Suffix automaton - Wikipedia

   en.wikipedia.org/wiki/Suffix_automaton

   By its definition, a suffix automaton can be obtained via minimization of the suffix trie. It may be shown that a compacted suffix automaton is obtained by both minimization of the suffix tree (if one assumes each string on the edge of the suffix tree is a solid character from the alphabet) and compaction of the suffix automaton. [17]

7. Generalized suffix tree - Wikipedia

   en.wikipedia.org/wiki/Generalized_suffix_tree

   An alternative to building a generalized suffix tree is to concatenate the strings, and build a regular suffix tree or suffix array for the resulting string. When hits are evaluated after a search, global positions are mapped into documents and local positions with some algorithm and/or data structure, such as a binary search in the starting ...