|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2007 Data Compression Conference (DCC'07)
Snowbird, Utah
March 27-March 29
ISBN: 0-7695-2791-4
| ASCII Text | x | ||
| Jan Lansky , Katsiaryna Chernik, Zuzana Vlickova, "Comparison of Text Models for BWT," Data Compression Conference, pp. 389, 2007 Data Compression Conference (DCC'07), 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/DCC.2007.21, author = {Jan Lansky and Katsiaryna Chernik and Zuzana Vlickova}, title = {Comparison of Text Models for BWT}, journal ={Data Compression Conference}, volume = {0}, year = {2007}, issn = {1068-0314}, pages = {389}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2007.21}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Data Compression Conference TI - Comparison of Text Models for BWT SN - 1068-0314 SP EP A1 - Jan Lansky , A1 - Katsiaryna Chernik, A1 - Zuzana Vlickova, PY - 2007 KW - null VL - 0 JA - Data Compression Conference ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2007.21
Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [1] from 1994 was designed for alphabet compression. In 2001, a new version working with word alphabet was introduced [2]. The newest version copes with syllable alphabet [3].
Citation:
Jan Lansky , Katsiaryna Chernik, Zuzana Vlickova, "Comparison of Text Models for BWT," dcc, pp.389, 2007 Data Compression Conference (DCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.