Suffix arrays / trees
5 important questions on Suffix arrays / trees
What is the suffix of a sequence?
Why do we assume the extra $ at the end of a sequence?
What makes suffix tries compact?
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
A sufix tree is a compact way of storing. Why? Explain, also with big O notation. And with regards to time?
- Edge labels are substrings of T: represented by T intervals.
- Exactly n+ 1 leaves and at most n internal nodes.
- At most 2n edges.
- Space linear in n:O(n).
Construction & time:
- LetT be a string of length n over a linearly-sortable alphabet. The suffix tree of T can be constructed in O(n) time (Farachs theorem).
In bioinformatics often sum = O(1) due to small alphabet!
For which nodes can you construct a suffix link?
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding