Welcome![Sign In][Sign Up]
Location:
Search - 短字符串压缩

Search list

[Other resourceqsort

Description: 可能是能找到的处理速度最快,处理能力最大的文本排序软件。软件里采用了如下技术加快排序速度和加大处理能力: 1.平衡二叉树排序;跳跃次数最少,路径最短; 2.重复字符串压缩存储;减少空间占用,也提高处理速度; 3.化零为整式申请内存,每次申请16M内存,减少了内存碎片,提高内存效率,同时也节省了内存申请所花的时间; 4.采用快速链接索引,可以快速跳到二叉树的分支; 5.含有按照通配符查找目录子目录所有文件的类,可快速排序整个目录和子目录的文本文件; 本软件用到C++诸多特征,是学习C++的好样板。
Platform: | Size: 16304 | Author: 叶一 | Hits:

[OtherSMAZ短字符串压缩

Description: 外国人写的短字符串压缩(SMAZ)
Platform: | Size: 7453 | Author: cjs1389 | Hits:

[Data structsqsort

Description: 可能是能找到的处理速度最快,处理能力最大的文本排序软件。软件里采用了如下技术加快排序速度和加大处理能力: 1.平衡二叉树排序;跳跃次数最少,路径最短; 2.重复字符串压缩存储;减少空间占用,也提高处理速度; 3.化零为整式申请内存,每次申请16M内存,减少了内存碎片,提高内存效率,同时也节省了内存申请所花的时间; 4.采用快速链接索引,可以快速跳到二叉树的分支; 5.含有按照通配符查找目录子目录所有文件的类,可快速排序整个目录和子目录的文本文件; 本软件用到C++诸多特征,是学习C++的好样板。
Platform: | Size: 114688 | Author: 叶一 | Hits:

[Compress-Decompress algrithms5275340D-2F87-4FAF-A46F-48070DD54B66

Description: lz编码译码LZW就是通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩. -lz codec LZW is through the establishment of a string table, with a shorter code to represent a long string to achieve compression.
Platform: | Size: 206848 | Author: kaidu | Hits:

[Compress-Decompress algrithmslzw

Description: 源代码通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩. 提取原始文本文件数据中的不同字符,基于这些字符创建一个编译表,然后用编译表中的字符的索引来替代原始文本文件数据中的相应字符,减少原始数据大小。我们这里的编译表不是事先创建好的,而是根据原始文件数据动态创建的,解码时可以从已编码的数据中还原出原来的编译表.-The source code through the establishment of a string table, with a shorter code to represent a long string to achieve compression. Extract the original text file data in a different character, based on these characters to create a compiled table, and then compile the table of characters the index to replace the original text file data in the corresponding characters, reducing the size of the original data. We are here to create pre-compiled form is not good, but dynamically created based on original file data, and decoding the encoded data can be restored out of the original build sheet.
Platform: | Size: 6144 | Author: udee | Hits:

[matlabLZW

Description: LZW就是通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩. -LZW is through the establishment of a string table, with a short code to represent long strings to achieve compression.
Platform: | Size: 4096 | Author: | Hits:

[Software EngineeringLZW_demo

Description: LZW编码的实现 LZW就是通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩。-LZW coding to achieve LZW is through the creation of a string table, with a shorter code to represent a long string to achieve compression.
Platform: | Size: 7168 | Author: 张怡然 | Hits:

[AI-NN-PRLZW-code

Description: LZW就是通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩。-LZW is through the establishment of a string table, with a shorter code to indicate a long string to achieve compression.
Platform: | Size: 7168 | Author: flxyd | Hits:

[Compress-Decompress algrithmslzw_compression

Description: LZW压缩编码源程序,用较短的代码来表示较长的字符串来实现压缩。 -LZW compression source code, with a shorter code to indicate a long string to achieve compression.
Platform: | Size: 5120 | Author: zzl | Hits:

[Bio-Recognizeproblem-LastBossOrigin

Description: 问题:找出一个短字符串在一个长字符串中的精确匹配。 要求:基于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-Wheeler transform algorithm to solve the problem
Platform: | Size: 1138688 | Author: Karen | Hits:

[Data structsHuffmanTree

Description: 霍夫曼编码是一种编码方式,是一种用于无损数据压缩的熵编码(权编码)算法。用变长编码表对源符号(如文件中的一个字母)进行编码,其中变长编码表是通过一种评估来源符号出现机率的方法得到的,出现机率高的字母使用较短的编码,反之出现机率低的则使用较长的编码,这便使编码之后的字符串的平均长度、期望值降低,从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding) for the algorithm. With variable-length coding tables on the source symbol (such as a file in a letter) to encode, which is a method of variable length coding table through an assessment of the probability of occurrence of the source symbols obtained letters appear high probability using a shorter code, and vice versa low appears machine code using a longer, which would make the average length of the string after encoding, expectations are lower, so as to achieve the purpose of lossless data compression.
Platform: | Size: 1024 | Author: lly | Hits:

[Compress-Decompress algrithmsbuildHuffmanTree

Description: 霍夫曼编码是一种编码方式,是一种用于无损数据压缩的熵编码(权编码)算法。用变长编码表对源符号(如文件中的一个字母)进行编码,其中变长编码表是通过一种评估来源符号出现机率的方法得到的,出现机率高的字母使用较短的编码,反之出现机率低的则使用较长的编码,这便使编码之后的字符串的平均长度、期望值降低,从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding) for the algorithm. With variable-length coding tables on the source symbol (such as a file in a letter) to encode, which is a method of variable length coding table through an assessment of the probability of occurrence of the source symbols obtained letters appear high probability using a shorter code, and vice versa low appears machine code using a longer, which would make the average length of the string after encoding, expectations are lower, so as to achieve the purpose of lossless data compression.
Platform: | Size: 1024 | Author: lly | Hits:

[Data structsHuffManSLN (1)

Description: 霍夫曼编码使用变长编码表对源符号(如文件中的一个字母)进行编码,其中变长编码表是通过一种评估来源符号出现机率的方法得到的,出现机率高的字母使用较短的编码,反之出现机率低的则使用较长的编码,这便使编码之后的字符串的平均长度、期望值降低,从而达到无损压缩数据的目的。(Huffman Hoffman uses a variable length encoding encoding encoding table of source symbols (such as file in a letter) for encoding, variable length encoding table which is through an evaluation method of source symbol appears likely to be the probability high letters use short encoding, and now the low probability of using longer encoding, which would make the average length of string encoding after the lowering of expectations, so as to achieve the purpose of lossless data compression.)
Platform: | Size: 881664 | Author: one1234 | Hits:

[Books算法基础.打开算法之门

Description: 算法基础:打开算法之门pdf 本书介绍了什么是计算机算法,如何描述它们,以及如何来评估它们。这些计算机算法将提供:利用计算机搜索信息的简单方式;解决各种排序问题的方法;利用有向无环图和最短路径法来解决基本问题的方法(可用于建模公路网络,任务间的依赖及金融关系);解决字符串(例如DNA结构)问题的方法;密码学背后的基本原理;数据压缩的基础知识;以及甚至一些没有人能够理解如何在计算机上用相当长的时间来解决的问题。(Algorithm basics: open the door to algorithms PDF This book describes what computer algorithms are, how to describe them, and how to evaluate them. These computer algorithms will provide: a simple way to search for information using a computer; Methods to solve various sorting problems; The use of directed acyclic graphs and shortest path methods to solve basic problems (which can be used to model road networks, inter-task dependencies, and financial relationships); Methods for solving problems with strings, such as the structure of DNA; The basic principles behind cryptography; Basic knowledge of data compression; And even some problems that no one can understand how to solve in a computer for a considerable amount of time.)
Platform: | Size: 32765952 | Author: 星星LNG | Hits:

CodeBus www.codebus.net