Title :
On fast and memory-efficient construction of an antidictionary array
Author :
Fukae, H. ; Ota, Takahisa ; Morita, Hiroyuki
Author_Institution :
Electron. Inf. Technol. Dept., Shikoku Polytech. Coll., Kochi, Japan
Abstract :
An antidictionary, a set of words that never appear in a given string, is a useful data structure for source coding as well as other fields of computer sciences. A fast and memory-efficient algorithm for constructing antidictionaries by means of suffix array is presented. We prove that the proposed algorithm constructs an antidictionary array with linear time and space.
Keywords :
computational complexity; set theory; string matching; word processing; antidictionary array; computer sciences; data structure; linear space; linear time; source coding; string; suffix array; word set; Arrays; Automata; Gold; Indexes; Information theory;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6283021
