An estimation of the size of non-vompact suffix trees
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the compact suffix trees, which have linear space complexity. The mo...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2016
|
| Sorozat: | Acta cybernetica
22 No. 4 |
| Kulcsszavak: | Programozás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.22.4.2016.6 |
| Online Access: | http://acta.bibl.u-szeged.hu/46422 |