老外的超高效率压缩，High efficient Data Compression Library for use with Delphi. Support Rank, ZIP, BZIP and PPM compression algorithms. Compression ratio more than 1.5-2 times better than ZIP/RAR archiver. Compression speed up to 8 Mb/sec (on PIII-600

水仙花的算法，水仙花是三位数，每一位的立方相加等于该数本身。-Narcissus algorithms, Narcissus is the three-digit, each and every one of the cube add up to equal to the number itself.

基因组重构是改变基因在基因组中排列顺序的生物过程,可归结为三种主要操作:移位、反转和转位。重组距离即从一个基因组转化为另一个基因组所需的最少重组次数。双重基因组中每条染色体都是成对出现的。双重基因组重构问题,即要求计算一个与给定基因组移位距离最短的双重基因组。对于该问题,Nadia El-Mabrouk等人给出了一个多项式时间算法。本文利用Delphi集成开发环境,将该算法实现为双重基因组重构软件:(1)设计了优化的数据结构 (2)给出了详细的实现方法。(3)调试验证了算法的正确性。 本文首先介

High efficient Data Compression Library for use with Delphi. Support Rank, ZIP, BZIP and PPM compression algorithms. Compression ratio more than 1.5-2 times better than ZIP/RAR archiver. Compression speed up to 8 Mb/sec (on PIII-600).