Hi -
So I'm just wondering how exactly the BWT works in creating "runs" of the same character in the last column after sorting the cycled string. Is it because of some frequency of nucleotides occurring conditionally that I'm not aware of? I get that in the English language I'm pretty sure that there are cases where a character is more likely to appear after another character (that's how BWT's effectiveness is explained in all texts i've found so far), but does this also apply to nucleotides?
•
written
by
gregoryhuang2005 •
1 answer
You are right, the BWT will have a hard time compressing random sequences of nucleotides as (uniform) random data is by definition hard to compress. However, genetic sequences are far from random. Just think of GC-bias, codon-bias, motifs, patterns in various forms (promotors, TATA-box), duplications, …. All of these reduce the "randomness" (entropy) of the data and instead increase the repetitiveness which the BWT then can exploit.
Log in to answer this question.
-
X chromosome in bedtoolsIntersect
written by wiscoyogi •
-
multiple response SRR URLs for the same service 's3'
written by akar_ozan01 •
-
Filtering of tricky overlapping sites in VCF
written by dr_cfoster
-
Criteria for performing PCA or ICA
written by hamid sta •
-
CWL workflow: setting default for array of integer input
written by cole.shaw •
-
Forum: Error in posting to Biostars?
written by vctrm67 •
-
Mapping contigs & scaffolds to ref genome?
written by YOUSEUFS •
-
Other ways to get allele frequencies for specific chromosome positions apart from 1000 genomes
written by python_fan •
-
ROH by PLINK
written by afadda •
-
Making a Dictionary for all Possible Mutations
written by abenabba •
