DMTCS Proceedings, 2005 International Conference on Analysis of Algorithms

Font Size:  Small  Medium  Large
DMTCS Conference vol AD (2005), pp. 307-322

DMTCS

2005 International Conference on Analysis of Algorithms

Conrado Martínez (ed.)

DMTCS Conference Volume AD (2005), pp. 307-322


author: Mark Daniel Ward and Wojciech Szpankowski
title: Analysis of the multiplicity matching parameter in suffix trees
keywords: suffix trees, combinatorics on words, pattern matching, autocorrelation polynomial, complex asymptotics, data compression
abstract: 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.
  If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.
reference: Mark Daniel Ward and Wojciech Szpankowski (2005), Analysis of the multiplicity matching parameter in suffix trees, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 307-322
bibtex: For a corresponding BibTeX entry, please consider our BibTeX-file.
ps.gz-source: dmAD0128.ps.gz (135 K)
ps-source: dmAD0128.ps (338 K)
pdf-source: dmAD0128.pdf (182 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.


Automatically produced on Di Sep 27 10:09:35 CEST 2005 by gustedt

Valid XHTML 1.0 Transitional