What are the advantages of using a Suffix Array over a Suffix Tree?
A Suffix Array is faster because it uses hashing to store suffixes and can be constructed in linear time.
Thatâ€™s partially correct. While Suffix Arrays can be constructed in linear time, they do not rely on hashing for storage. They store suffix indices instead.
Can you explain the role of suffix indices in the construction of a Suffix Array and how they differ from direct tree nodes in a Suffix Tree?