On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree

Authors:
Takahiro Ota;Hiroyoshi Morita
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 10
Cited 1

A note on the height of suffix trees

SIAM Journal on Computing
Text algorithms

Text algorithms
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Automata and forbidden words

Information Processing Letters
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Words and forbidden factors

Theoretical Computer Science
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Antidictionary Based Compression

SCCC '02 Proceedings of the XII International Conference of the Chilean Computer Science Society
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

Length of minimal forbidden words on a stationary ergodic source

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The antidictionary of a string is the set of all words of minimal length that never appear in this string. Antidictionaries are in particular useful for source coding. We present a fast and memory-efficient algorithm to construct an antidictionary using a suffix tree. It is proved that the complexity of this algorithm is linear in space and time, and its effectiveness is demonstrated by simulation results.