Skip to Main Content
Talk Beginner First Talk

Using Burrows Wheeler Algorithms for DNA sequencing analysis

Proposal status is Approved
Session Description

DNA Next Generation sequencing is a powerful, although not fully new technique for understanding genomes and transcriptomes of species. With each sample requiring multiple gigabytes of storage, analysing the DNA patterns becomes challenging. This is the reason behind the invention of the burrows wheeler algorithm, which reduces the time of analysis to the order of 10^(-4). This is not a new algorithm, but newer iterations are being built using this as the base, which is why it is important to understand the algorithm.

Key Takeaways

Understanding how DNA sequence data is depicted and stored. How the algorithm works. How this information can be used to conduct bioinformatics research.

References

https://pmc.ncbi.nlm.nih.gov/articles/PMC2705234/

Session Categories

Knowledge Commons (Open Hardware, Open Science, Open Data etc.)

Speakers

Aditya Undru
Aditya Undru Science Communicator | CSIR CCMB

Aditya is a Bioinformatician with a PhD in Molecular Neuroscience from CSIR CCMB, Hyderabad. He has expertise in DNA, RNA and ChIP sequencing analysis as part of his research regarding hypoxic preconditioning in the brains of Zebrafish.

https://www.linkedin.com/in/adityaundru