Construct · 1 fields · 1 citations

suffix tree: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a compressed tree of all suffixes of a string, built in linear time, that answers substring and pattern-matching queries quickly.

In algorithms and data structures, suffix tree refers to a compressed tree of all suffixes of a string, built in linear time, that answers substring and pattern-matching queries quickly. This meaning comes from Weiner (1973) in 14th Annual Symposium on Switching and Automata Theory (swat 1973).[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how suffix tree sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

string4 fields · 6 citationsjingle · one word, four constructs tree3 fields · 4 citationsjingle · one word, three constructs

References

Weiner, P. (1973). Linear pattern matching algorithms. 14th Annual Symposium on Switching and Automata Theory (swat 1973). https://doi.org/10.1109/swat.1973.13

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct