Orlov Y L, Potapov V N
Institute of Mathematics SB RAS, prosp. Koptyuga 4, Novosibirsk, 630090 Russia.
Nucleic Acids Res. 2004 Jul 1;32(Web Server issue):W628-33. doi: 10.1093/nar/gkh466.
The search for DNA regions with low complexity is one of the pivotal tasks of modern structural analysis of complete genomes. The low complexity may be preconditioned by strong inequality in nucleotide content (biased composition), by tandem or dispersed repeats or by palindrome-hairpin structures, as well as by a combination of all these factors. Several numerical measures of textual complexity, including combinatorial and linguistic ones, together with complexity estimation using a modified Lempel-Ziv algorithm, have been implemented in a software tool called 'Complexity' (http://wwwmgs.bionet.nsc.ru/mgs/programs/low_complexity/). The software enables a user to search for low-complexity regions in long sequences, e.g. complete bacterial genomes or eukaryotic chromosomes. In addition, it estimates the complexity of groups of aligned sequences.
寻找低复杂度的DNA区域是现代全基因组结构分析的关键任务之一。低复杂度可能由核苷酸含量的强烈不均衡(偏向性组成)、串联或分散重复序列、回文-发夹结构以及所有这些因素的组合所导致。文本复杂度的几种数值度量方法,包括组合和语言学方法,以及使用改进的莱姆佩尔-齐夫算法进行的复杂度估计,已在一个名为“Complexity”的软件工具(http://wwwmgs.bionet.nsc.ru/mgs/programs/low_complexity/)中实现。该软件能让用户在长序列(如完整的细菌基因组或真核染色体)中搜索低复杂度区域。此外,它还能估计比对序列组的复杂度。