搜索资源列表
BWT
- BWT压缩方法描述，是一种被bzip2等数据压缩技术所使用的算法-The Burrows–Wheeler transform (BWT, also called block-sorting compression), is an algorithm used in data compression techniques such as bzip2.
BWT
- Burrows-Wheeler转换,也称为块排序，是80年代提出来的一种新型压缩方法，对文本有很好的压缩率。-Burrows-Wheeler Transformation,also called Block Sorting
bwt
- Burrows Wheeler Transform_Encoder and Decoder
bwt
- The Burrows wheeler transform of matrix x, it will calculate the Burrows wheeler transform of the matrix a and will output the encoded signal with primary index value
bwtenc
- The Burrows wheeler transform of matrix x, it will calculate the Burrows wheeler transform of the matrix a and will output the encoded signal with primary index value this program will calculate the burrows wheeler transform of input image and
bwtdec
- The Burrows wheeler transform of matrix x, it will decode the Burrows wheeler transformed matrix a and will output the original image with this program will re-calculate the original image of input bwt imag
main.cpp
- Burrows–Wheeler transform with Karkkainen and Sanders algorithm
BWA--v2.1
- 基于BWT的DNA短序列分析程序. BWT是一种压缩算法，主要利用BWT压缩的思想建立索引进行搜索。 BWA（Burrows–Wheeler Alignment）用BWT提供的索引进行快速搜索。-Based on the BWT of short DNA sequence analysis program. BWT is a compression algorithm, BWT compressed thought indexing search. BWA (Burrows-Wheele
problem-LastBossOrigin
- 问题：找出一个短字符串在一个长字符串中的精确匹配。 要求：基于BWT压缩和FM索引技术的序列匹配，用Burrows-Wheeler transform算法解决该问题。-Problem: find the exact match of a short string in a long string. Requirements: BWT-based compression and indexing techniques sequence matching FM, with the Burrows
BWT_Compre1508411252002
- Compression using Burrows Wheeler Transform. Includes n*log(n) comparison tri-partite suffix array block sorting, Move-to-Front coding, dynamic canonical Huffman coding of Wheeler s run-length-coding.