Algoritmy nad rozšířeným sufixovým polem
Suffix tree is one of the most important data structures in string processing. However, the space consumption of the suffix tree is a bottleneck in large scale applications. Suffix array is by contrast a space efficient data structure having not so large domain of applications. To allow usage of the...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2009
|
| Online Access: | http://www.nusl.cz/ntk/nusl-275249 |
| Summary: | Suffix tree is one of the most important data structures in string processing. However, the space consumption of the suffix tree is a bottleneck in large scale applications. Suffix array is by contrast a space efficient data structure having not so large domain of applications. To allow usage of the suffix array in more complex applications, we have to enhance it with an additional information. This work is aimed at a study of the enhanced suffix array and suffix tree in selected applications. |
|---|