在经典信息论的基础上，提出了一种新型的有损数据简约算法，该算法克服了其它数据简约算法的不足。
A new, lossy data reduction method based on information theory is described in this paper, which overcomes problems associated with other data reduction methods.
结果表明，使用最大简约算法，改变空位罚分时，树长的变化与信息位点数目的变化规律并不完全一致。
Results of MP analysis show that changes of tree length and number of informative sites aren't same with each other when gap penalties change.
程序员们应当十分熟悉简约的概念，他们知道好算法往往更简短且更清楚。
This concept is well known to programmers, who recognize that better algorithms are clearer and shorter.
应用推荐