Complexity: an internet resource for analysis of DNA sequence complexity.
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.
Orlov
Y L
YL
Institute of Mathematics SB RAS, prosp. Koptyuga 4, Novosibirsk, 630090 Russia. orlov@bionet.nsc.ru
Potapov
V N
VN
D000465:Algorithms; D002875:Chromosomes; D016680:Genome, Bacterial; D020407:Internet; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA; D012984:Software; D014584:User-Computer Interface