Paper Abstract and Keywords |
Presentation |
2005-07-22 10:50
Construction Antidictionary of a Binary String Using Suffix Tree Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a given string, a method used suffix trie has been known. But the complexity of the method is quadratic in both of time and space.
In this article, we present an algorithm to construct antidictionary of a given string, based on suffix tree representation of the string. The proposed algorithm needs linear computational time and space with respect to the sequence length. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
antidictionary / minimal forbidden word / suffix tree / linear / computational complexity / / / |
Reference Info. |
IEICE Tech. Rep., vol. 105, no. 191, IT2005-43, pp. 9-14, July 2005. |
Paper # |
IT2005-43 |
Date of Issue |
2005-07-15 (IT) |
ISSN |
Print edition: ISSN 0913-5685 |
Download PDF |
|
Conference Information |
Committee |
IT |
Conference Date |
2005-07-21 - 2005-07-22 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Osaka Prefecture Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
fresshman session, general |
Paper Information |
Registration To |
IT |
Conference Code |
2005-07-IT |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Construction Antidictionary of a Binary String Using Suffix Tree |
Sub Title (in English) |
|
Keyword(1) |
antidictionary |
Keyword(2) |
minimal forbidden word |
Keyword(3) |
suffix tree |
Keyword(4) |
linear |
Keyword(5) |
computational complexity |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Takahiro Ota |
1st Author's Affiliation |
Nagano Prefectural Institute of Technology (PIT Nagano) |
2nd Author's Name |
Hiroyoshi Morita |
2nd Author's Affiliation |
University of Electro-Commnunications (UEC) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2005-07-22 10:50:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2005-43 |
Volume (vol) |
vol.105 |
Number (no) |
no.191 |
Page |
pp.9-14 |
#Pages |
6 |
Date of Issue |
2005-07-15 (IT) |