Vásárhelyi Bálint: An estimation of the size of non-vompact suffix trees. In: Acta cybernetica, (22) 4. pp. 113-122. (2016)
Preview |
Cikk, tanulmány, mű
actacyb_22_4_2016_6.pdf Download (313kB) | Preview |
Abstract
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 motivation of this paper is the question whether the space complexity of simple suffix trees is quadratic not only in the worst case, but also in expectation.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2016 |
| Volume: | 22 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 113-122 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/46414/ |
| DOI: | 10.14232/actacyb.22.4.2016.6 |
| Uncontrolled Keywords: | Programozás |
| Additional Information: | Bibliogr.: p. 831-832. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2017. Mar. 16. 14:42 |
| Last Modified: | 2022. Jun. 20. 13:45 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/46422 |
Actions (login required)
 |
View Item |
