I wrote an introductory post on Burrows Wheeler Transform that powers many efficient search programs such as Bowtie, BWA and SOAP2.
We usually do not cover topics that are explained everywhere else, and BWT is over 20 years old - so old that it even has a wiki page. However, I could not find a simple explanation of LF mapping property anywhere. LF mapping is used by search programs to map short reads onto reference sequence.
Is it important to learn how the algorithm works to use Bowtie and BWA? I do not think so, but I enjoy shows like car-talk without ever intending to get under the car
We usually do not cover topics that are explained everywhere else, and BWT is over 20 years old - so old that it even has a wiki page. However, I could not find a simple explanation of LF mapping property anywhere. LF mapping is used by search programs to map short reads onto reference sequence.
Is it important to learn how the algorithm works to use Bowtie and BWA? I do not think so, but I enjoy shows like car-talk without ever intending to get under the car
Comment