Alphabetic Processing Models on Burrows Wheeler Transformed Text  

Oleh:

Kusnadi

Jenis: Article from Journal - ilmiah nasional
Dalam koleksi: Jurnal Teknologi Industri vol. 9 no. 4 (Oct. 2005), page 307-316.
Topik: Top-Down Organization; Alphabetic Processing; Data Compression

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: JJ83.6 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

There have been a lot of efforts to improve the effectiveness of Burrows Wheeler Transformation compression schemes, most of which proceed input symbols according to the orderings of their occurences in the Burrows Wheeler Transformed texts. this paper describes an alternative approach which proceeds Burrows Wheeler Transformed texts according to their alphabet orderings in the first place and the results are persented.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali