Charging Station: Finding Frequent Words by Sorting
Explore how sorting and counting k-mers in DNA sequences enables the identification of frequent words. Learn to implement the FindingFrequentWordsBySorting algorithm to analyze genetic data and deepen your understanding of bioinformatics methods related to DNA replication.
We'll cover the following...
We'll cover the following...
Sorting k-mers
To see how sorting can help us find frequent k-mers, we’ll consider a motivating example when k = 2. Given a string Text = AAGCAAAGGTGGG, list all its 2-mers in the order they appear in Text, and convert each 2-mer into an integer using PatternToNumber to produce an array Index, as shown below:
We’ll now sort ...