On the Number of 2-Protected Nodes in Tries and Suffix Trees

We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.80...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AQ,...; no. Proceedings; pp. 381 - 398
Main Authors:	Gaither, Jeffrey, Homma, Yushi, Sellke, Mark, Ward, Mark Daniel
Format:	Journal Article Conference Proceeding
Language:	English
Published:	DMTCS 01.01.2012 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Series:	DMTCS Proceedings
Subjects:	[info.info-cg] computer science [cs]/computational geometry [cs.cg] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [math.math-co] mathematics [math]/combinatorics [math.co] Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics Mathematics mellin transforms pattern matching poissonization retrieval trees suffix trees retrieval trees pattern matching suffix trees Mellin transforms Poissonization
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!