1. Suffix treeIn computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations. The suffix tree for a string is a tree whose edges are labeled with strings, such that each suffix of corresponds to exactly one path from the tree's root to a leaf.
Read “Suffix tree” on English Wikipedia
Read “接尾辞木” on Japanese Wikipedia
Read “Suffix tree” on DBpedia
Read “Suffix tree” on English Wikipedia
Read “接尾辞木” on Japanese Wikipedia
Read “Suffix tree” on DBpedia
Discussions
Log in to talk about this word.