1
$\begingroup$

Is there any algorithm that can efficiently construct a generalized suffix tree or array (or something similar) for a set of strings represented by a prefix tree (trie)?

In particular, I'm wondering:

  • How time-efficient an algorithm for this can be

  • How space-efficient the resulting data structure can be

  • What algorithm(s) might be able to do this, if any

D.W. ♦
169k23 gold badges236 silver badges519 bronze badges
asked Mar 28, 2023 at 6:08
$\endgroup$
0

0

Know someone who can answer? Share a link to this question via email, Twitter, or Facebook.

Your Answer

Draft saved
Draft discarded

Sign up or log in

Sign up using Google
Sign up using Email and Password

Post as a guest

Required, but never shown

Post as a guest

Required, but never shown

By clicking "Post Your Answer", you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.