This is one if the *optional* lectures in the series. Here we discuss how sequencing by synthesis can make mistakes, and how software tools called base callers attempt to determine each base and characterize the uncertainty of each call. Course page: https://www.coursera.org/course/ads1.
── Course & channel links ──
Course playlist: Algorithms for DNA Sequencing
https://www.youtube.com/playlist?list=PL2mpR0RYFQsBiCWVJSvVAO3OJ2t7DzoHA
── About the author ──
Ben Langmead is a Professor of Computer Science at Johns Hopkins University, where his research spans bioinformatics, computational biology, and data-intensive science. He is the author of Bowtie and Bowtie 2; his group has also developed software like Kraken 2 and resources like recount3 and Index Zone, as well as methods for pangenome indexing and querying, based on e.g. the r-index and move structure. His group's methods have been cited over 130,000 times, and he is the winner of awards including an NSF CAREER award, a Sloan Research Fellowship, the Benjamin Franklin award for contributions to open access, and multiple awards for teaching and mentorship. Ben is the founder and principal of InOrder Labs LLC (https://inorderlabs.com), an expert consulting firm in bioinformatics and computational biology.
Channel: https://www.youtube.com/@BenLangmead
Teaching materials: https://langmead-lab.org/teaching.html
