Art

J-GLOBAL ID：201602207890354220   Reference number：16A0216037

Efficient Implementation and Empirical Evaluation of Compression by Substring Enumeration

部分文字列数え上げによる圧縮の効率的実現と実験的評価

Author (4)： KANAI Sho (Graduate School of Sci. and Technol., Gunma Univ.) ,  YOKOO Hidetoshi (Graduate School of Sci. and Technol., Gunma Univ.) ,  YAMAZAKI Kosumo (Graduate School of Sci. and Technol., Gunma Univ.) ,  KANEYASU Hideaki (Graduate School of Sci. and Technol., Gunma Univ.)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web)  (IEICE Trans Fundam Electron Commun Comput Sci (Web))
Volume： E99.A  Issue： 2  Page： 601-611 (J-STAGE)  Publication year： 2016 
JST Material Number： U0466A  ISSN： 1745-1337  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *Data Compression ,  matching (graph) ,  *coder ,  decoder ,  *data ,  experiment ,  parallel arithmetic ,  fast algorithm ,  asymptotic behavior ,  data conversion ,  mathematical transformation ,  subset ,  code ,  *lossless compression ,  evaluation experiment ,  array processing
Semi thesaurus term： string matching ,  *large data ,  array processing ,  asymptotic optimality ,  *reversible compression ,  universal code

JST classification (1)： Code theory  (ND02030R)

Reference (21)：

• [1] M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch, “The enhanced suffix array and its applications to genome analysis,” Algorithms in Bioinformatics, Lecture Notes in Computer Science, vol.2452, pp.449-463, Springer Berlin Heidelberg, Berlin, Heidelberg, 2002.
• [2] T. Asano, S. Bereg, and D. Kirkpatrick, “Finding nearest larger neighbors,” Efficient Algorithms, Lecture Notes in Computer Science, vol.5760, pp.249-260, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
• [3] M. Béliveau and D. Dubé, “Improving compression via substring enumeration by explicit phase awareness,” Proc. 2014 Data Compression Conference, p.399, 2014.
• [4] T. Beller, S. Gog, E. Ohlebusch, and T. Schnattinger, “Computing the longest common prefix array based on the Burrows-Wheeler transform,” J. Discrete Algorithms, vol.18, pp.22-31, 2013.
• [5] M. Burrows and D.J. Wheeler, “A block-sorting lossless data compression algorithm,” SRC Research Report, 124, 1994.

Terms in the title (3)： 文字列 ,  実験 ,  評価