Covers fundamental computational problems from comparative genomics and evolutionary biology. Topics include multiple sequence alignment and the reconstruction of evolutionary histories (e.g., phylogenetic trees and networks). These tasks are typically framed as NP-hard optimization problems, motivating the development of heuristics based on constraints, graph algorithms, and more recently machine learning. We analyze algorithms from the empirical and theoretical perspectives (e.g., computational complexity, optimality guarantees, and statistical consistency under popular models of evolution). Lastly, we discuss how algorithms are leveraged in emerging applications, like evolutionary analyses of tumors and pathogens, along with their limitations and directions for future research.
3 terms
Other grades
University of Maryland
CMSC 702 at UMD: average GPA 3.79 across 86 students. Grade distribution by term. Covers fundamental computational problems from comparative genomics and…
Average GPA: 3.79
Grade distribution records: 86 students across 3 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 22 | 25.6% |
| A | 33 | 38.4% |
| A- | 15 | 17.4% |
| B+ | 6 | 7.0% |
| B | 3 | 3.5% |
| B- | 3 | 3.5% |
| C+ | 1 | 1.2% |
| W | 3 | 3.5% |
Based on 86 student grade records across 3 terms and 2 professors.
Also in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades