July 10, 17, 24, 6-9 PM, Cupertino
To enroll (once enrollment opens), click here.
DNA sequencing technologies are producing data at an incredible rate. Sequence databases are continually growing in size and number. The rate of queries to these databases is also increasing, as more scientists are recognizing the value of database searches. Consequently, the need for ultra-fast searches is in greater demand than ever.
This short course (9 hours of lectures) covers advanced algorithms from computer science for ultra-fast database searching. Actual success stories of these methods (their actual use in several public databases) will also be discussed. The course is designed for bioinformatics software developers, computer scientists, mathematicians, physicists, statisticians, and biologists with an interest in the topic.
"Advanced Sequence Analysis in Bioinformatics" or a course in data structures and algorithms or a course in discrete math.
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Dan Gusfield, Cambridge University Press. All lectures will be drawn from this book. It is upto you whether you want to buy it.
There will be no mandatory assignments. Optional practice assignments (not to be turned in) will be posted to the course's private web site.