Linguistic sequence complexity

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Linguistic sequence complexity (LC) is a measure of the 'vocabulary richness' of a genetic text in gene sequences.[1] When a nucleotide sequence is written as text using a four-letter alphabet, the repetitiveness of the text, that is, the repetition of its N-grams (words), can be calculated and serves as a measure of sequence complexity. Thus, the more complex a DNA sequence, the richer its oligonucleotide vocabulary, whereas repetitious sequences have relatively lower complexities. Subsequent work improved the original algorithm described in Trifonov (1990),[1] without changing the essence of the linguistic complexity approach.[2][3][4]

The meaning of LC may be better understood by regarding the presentation of a sequence as a tree of all subsequences of the given sequence. The most complex sequences have maximally balanced trees, while the measure of imbalance or tree asymmetry serves as a complexity measure[disambiguation needed]. The number of nodes at the tree level i is equal to the actual vocabulary size of words with the length i in a given sequence; the number of nodes in the most balanced tree, which corresponds to the most complex sequence of length N, at the tree level i is either 4i or N-j+1, whichever is smaller. Complexity (C) of a sequence fragment (with a length RW) can be directly calculated as the product of vocabulary-usage measures (Ui):[2]

     

Vocabulary usage for oligomers of a given size i can be defined as the ratio of the actual vocabulary size of a given sequence to the maximal possible vocabulary size for a sequence of that length. For example, U2 for the sequence ACGGGAAGCTGATTCCA = 14/16, as it contains 14 of 16 possible different dinucleotides; U3 for the same sequence = 15/15, and U4=14/14. For the sequence ACACACACACACACACA, U1=1/2; U2=2/16=0.125, as it has a simple vocabulary of only two dinucleotides; U3 for this sequence = 2/15. k-tuples with k from two to W considered, while W depends on RW. For RW values less than 18, W is equal to 3; for RW less than 67, W is equal to 4; for RW<260, W=5; for RW<1029, W=6, and so on. The value of C provides a measure of sequence complexity in the range 0<C<1 for various DNA sequence fragments of a given length.[2] This formula is different from the original LC measure[1] in two respects: in the way vocabulary usage Ui is calculated, and because i is not in the range of 2 to N-1 but only up to W. This limitation on the range of Ui makes the algorithm substantially more efficient without loss of power.[2] In [5] was used another modified version, wherein linguistic complexity (LC) is defined as the ratio of the number of substrings of any length present in the string to the maximum possible number of substrings. Maximum vocabulary over word sizes 1 to m can be calculated according to the simple formula .[5] This sequence analysis complexity calculation can be used to search for conserved regions between compared sequences for the detection of low-complexity regions including simple sequence repeats, imperfect direct or inverted repeats, polypurine and polypyrimidine triple-stranded DNA structures, and four-stranded structures (such as G-quadruplexes).[6]

References[edit]

  1. ^ a b c Edward N. Trifonov (1990). "Making sense of the human genome". Structure and Methods, Vol. 1. Human Genome Initiative and DNA Recombination; Proceedings of the Sixth Conversation in the Discipline Biomolecular Stereodynamics. Albany, New York: Adenine Press. pp. 69–77. 
  2. ^ a b c d Gabrielian, A. (1999). "Sequence complexity and DNA curvature". Computers & Chemistry. 23 (3–4): 263–201. doi:10.1016/S0097-8485(99)00007-8. 
  3. ^ Orlov, Y. L.; Potapov, V. N. (2004). "Complexity: An internet resource for analysis of DNA sequence complexity". Nucleic Acids Research. 32 (Web Server issue): W628–W633. PMC 441604Freely accessible. PMID 15215465. doi:10.1093/nar/gkh466. 
  4. ^ Janson, S.; Lonardi, S.; Szpankowski, W. (2004). "On average sequence complexity". Theoretical Computer Science. 326: 213–227. doi:10.1016/j.tcs.2004.06.023. 
  5. ^ a b Troyanskaya, O. G.; Arbell, O.; Koren, Y.; Landau, G. M.; Bolshoy, A. (2002). "Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity". Bioinformatics. 18 (5): 679–88. PMID 12050064. doi:10.1093/bioinformatics/18.5.679. 
  6. ^ Kalendar, R.; Lee, D.; Schulman, A. H. (2011). "Java web tools for PCR, in silico PCR, and oligonucleotide assembly and analysis". Genomics. 98 (2): 137–144. PMID 21569836. doi:10.1016/j.ygeno.2011.04.009.