Analysis of the multiplicity matching parameter in suffix trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Analysis of the multiplicity matching parameter in suffix trees


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
Origin : Publisher files allowed on an open archive

Dates and versions

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



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⟩


92 View
392 Download



Gmail Facebook X LinkedIn More