INFO-B 536 Computational Methods for Biomedical Informatics
- Prerequisite(s): None
- Delivery: On-Campus
This course covers algorithm design, algorithm analysis, and complexity analysis and their applications in biomedical informatics.
- Evaluate common problems in biomedical informatics, such as sequence alignment, genome arrangement, and peptide identification.
- Analyze time and space complexity and other theoretical concepts used in algorithm analysis and complexity analysis.
- Apply abstract data structures to solve problems in biomedical informatics.
- Compare the advantages and disadvantages of computational methods for a biomedical problem and choose appropriate methods.
- Evaluate the similarity between new problems and existing problems and adapt computational methods designed for existing problems to new problems.
- Design computational methods using a greedy, brute-force, divide-and-conquer, or dynamic programming approach.
- Evaluate biomedical problems using example-based problem-solving skills and iterative refinement skills.
- Design and perform experiments for evaluating computational methods and publicly present experimental results.
Policies and Procedures
Please be aware of the following linked policies and procedures. Note that in individual courses instructors will have stipulations specific to their course.