Search result for Courses taught by Pavel Pevzner
FollowFilter ![]()
Filter ![]()
Showing 9 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Algorithms and Data Structures Capstone
by Pavel Pevzner , Phillip Compeau- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
Synthesize your knowledge of algorithms and biology to build your own software for solving a biological challenge. Building a fully-fledged algorithm to assemble genomes from DNA fragments on a real dataset is an enormous challenge with major demand in the multi-billion dollar biotech industry. This big data challenge will cover the entire MicroMasters program....
$150
Graph Algorithms in Genome Sequencing
by Pavel Pevzner , Phillip Compeau- 0.0
-
![]()
![]()
![]()
![]()
![]()
3 Weeks
Learn how graphs are used to assemble millions of pieces of DNA into a contiguous genome and use these genomes to construct a Tree of Life. In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn how graph algorithms are used in two fundamental problems in modern biology:...
$150
Dynamic Programming: Applications In Machine Learning and Genomics
by Pavel Pevzner , Phillip Compeau- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
Learn how dynamic programming and Hidden Markov Models can be used to compare genetic strings and uncover evolution. If you look at two genes that serve the same purpose in two different species, how can you rigorously compare these genes in order to see how they have evolved away from each other?...
$150
Introduction to Genomic Data Science
by Pavel Pevzner , Phillip Compeau- 0.0
-
![]()
![]()
![]()
![]()
![]()
Join us on the frontier of bioinformatics and learn how to look for hidden messages in DNA without ever needing to put on a lab coat. In the first half of this course, we'll investigate DNA replication, and ask the question, where in the genome does DNA replication begin? Perhaps surprisingly, we will apply randomized algorithms to solve problems....
$49
Algorithmic Design and Techniques
by Pavel Pevzner , Daniel Kane , Alexander S. Kulikov , Michael Levin- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Learn how to design algorithms, solve computational problems and implement solutions efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming....
$99
String Processing and Pattern Matching Algorithms
by Pavel Pevzner , Michael Levin- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
Learn about pattern matching and string processing algorithms and how they apply to interesting applications. The world and internet are full of textual information. We search for information using textual queries and read websites, books and e-mails. These are all strings from a computer science point of view. suffix trees; suffix arrays;...
$150
Algorithmic Toolbox
by Alexander S. Kulikov , Michael Levin , Neil Rhodes , Pavel Pevzner , Daniel M Kane- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 39 hours to complete
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second). Programming Challenges Welcome!...
Algorithms on Strings
by Alexander S. Kulikov , Michael Levin , Pavel Pevzner , Neil Rhodes- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Suffix Trees...
Genome Assembly Programming Challenge
by Alexander S. Kulikov , Michael Levin , Pavel Pevzner , Neil Rhodes- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
In Spring 2011, thousands of people in Germany were hospitalized with a deadly disease that started as food poisoning with bloody diarrhea and often led to kidney failure. It was the beginning of the deadliest outbreak in recent history, caused by a mysterious bacterial strain that we will refer to as E....
Top Online Courses and Specializations | Coursera
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Find Courses and Specializations from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
Coursera | Online Courses & Credentials From Top Educators. Join for Free
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Learn online and earn valuable credentials from top universities like Yale, Michigan, Stanford, and leading companies like Google and IBM. Join Coursera for free and transform your career with degrees, certificates, Specializations, & MOOCs in data science, computer science, business, and dozens of other topics....
