| author: | Hiroyoshi Morita and Takahiro Ota |
|---|---|
| title: | A tight upper bound on the size of the antidictionary of a binary string |
| keywords: | antidictionary, minimum forbidden words, suffix trees, data compression, ECG |
| abstract: | A tight upper bound of the size of the antidictionary of a binary string is presented. And it is shown that the size of the antidictionary of a binary sting is always smaller than or equal to that of its dictionary. Moreover, an algorithm to reconstruct its dictionary from its antidictionary is given. |
| 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: | Hiroyoshi Morita and Takahiro Ota (2005), A tight upper bound on the size of the antidictionary of a binary string, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 393-398 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAD0137.ps.gz (509 K) |
| ps-source: | dmAD0137.ps (883 K) |
| pdf-source: | dmAD0137.pdf (430 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.