Talk:Suffix tree: Difference between revisions
m
try to address the missing reference message ... looks plausible in preview, let's see if it really works...
(→definition?: new section) |
m (try to address the missing reference message ... looks plausible in preview, let's see if it really works...) |
||
Line 10:
:* edges spell non-empty strings,
:* and all internal nodes (except perhaps the root) have at least two children.
:*{{citation
| last1 = Barsky | first1 = Marina
| last2 = Stege | first2 = Ulrike
| last3 = Thomo | first3 = Alex
| last4 = Upton | first4 = Chris
| contribution = A new method for indexing genomes using on-disk suffix trees
| location = New York, NY, USA
| pages = 649–658
| publisher = ACM
| title = CIKM '08: Proceedings of the 17th ACM Conference on Information and Knowledge Management
| year = 2008}}.
But this can be satisfied by a tree with only a root where each node is a unique suffix. Something is missing from this definition, and that something seems to have something to do with substrings which appear in multiple locations in the string.
| |||