Analysis of the multiplicity matching parameter in suffix trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Analysis of the multiplicity matching parameter in suffix trees

Résumé

In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion. Equivalently, the MMP is the number of pointers into the database in the Lempel-Ziv '77 data compression algorithm. We prove that the MMP asymptotically follows the logarithmic series distribution plus some fluctuations. In the proof we compare the distribution of the MMP in suffix trees to its distribution in tries built over independent strings. Our results are derived by both probabilistic and analytic techniques of the analysis of algorithms. In particular, we utilize combinatorics on words, bivariate generating functions, pattern matching, recurrence relations, analytical poissonization and depoissonization, the Mellin transform, and complex analysis.
Fichier principal
Vignette du fichier
dmAD0128.pdf (182.08 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184222 , version 1 (13-08-2015)

Identifiants

Citer

Mark Daniel Ward, Wojciech Szpankowski. Analysis of the multiplicity matching parameter in suffix trees. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.307-322, ⟨10.46298/dmtcs.3387⟩. ⟨hal-01184222⟩

Collections

INSMI TDS-MACS
94 Consultations
422 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More