File:Constructing the suffix tree of banana based on the suffix array and the LCP array - Case 2.pdf
Summary
| Description |
English: This picture shows case 1 of the suffix tree construction algorithm that uses the suffix array and the LCP array to construct the suffix tree, as described in en:LCP array#Suffix tree construction.
Suppose the suffixes a$, ana$, anana$, banana$ and na$ of the string banana$ are already added to the suffix tree. Then the suffix nana$ is added to the tree as shown in the picture. |
| Date | |
| Source | Own work |
| Author | Schlag.sebastian |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.