Data structures built to answer questions about ranges and substrings quickly after a one-time preparation of the data. The segment tree and the Fenwick tree answer queries about intervals of an array, such as sums over a range, while updating values efficiently. The suffix tree and the suffix array index every suffix of a text so that any pattern can be located without scanning the whole string again.
Browse By
Interval and String Indexing Structures
Filter Results4 entries
Sources
Segment tree, Wikipedia
Has Member: Segment Tree, LeadQuote, Has Member: Segment Tree, Lead
In computer science, the segment tree is a data structure used for storing information about intervals or segments.
Wikipedia: Fenwick Tree
Wikimedia FoundationHas Member: Fenwick Tree, LeadQuote, Has Member: Fenwick Tree, Lead
A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and update the values.
Wikipedia: Suffix Tree
Wikimedia FoundationHas Member: Suffix Tree, LeadQuote, Has Member: Suffix Tree, Lead
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.
Wikipedia: Suffix Array
Wikimedia FoundationHas Member: Suffix Array, LeadQuote, Has Member: Suffix Array, Lead
In computer science, a suffix array is a sorted array of all suffixes of a string.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.