Shortest not repeatable Substring with Suffix-Tree

Question

I need to design an efficient algorithm that finds the Shortest non-repeatable Substring in a text. In essence; the shortest string that appears only once in a text. This has to be made only with suffix-tree

Example 1:

Text: AATGCCTA then Result: G

Example 2:

Text: AAAAGGGG then Result: AG

The efficient way to construct a suffix tree is [Ukkonen's algorithm](https://en.wikipedia.org/wiki/Ukkonen%27s_algorithm). — choroba, May 04 '21 at 22:03
The shortes non-repeatable substring is the shortest unique prefix of all the suffixes. — choroba, May 04 '21 at 22:20

score 1 · Accepted Answer · answered May 04 '21 at 22:31

1

The shortes non-repeatable substring is the shortest unique prefix of all the suffixes.

See Minimum Unique Substrings and Maximum Repeats by Lucian Ilie and W. F. Smyth.

answered May 04 '21 at 22:31

choroba

231,213
25
204
289

Thanks a lot this is very helpful. – George Verouchis May 04 '21 at 22:36

Shortest not repeatable Substring with Suffix-Tree

1 Answers1