Careers360 Logo
ask-icon
share
    Compare

    Quick Facts

    Medium Of InstructionsMode Of LearningMode Of Delivery
    EnglishSelf StudyVideo and Text Based

    Courses and Certificate Fees

    Fees InformationsCertificate AvailabilityCertificate Providing Authority
    USD 150yesUC San Diego

    The Syllabus

    • A review of dynamic programming, and applying it to basic string comparison algorithms. 

    • Learn how to generalize your dynamic programming algorithm to handle a number of different cases, including the alignment of multiple strings.

    • Learn what a Hidden Markov model is and how to find the most likely sequence of events given a collection of outcomes and limited information.

    • Formulate sequence alignment using a Hidden Markov model, and then generalize this model in order to obtain even more accurate alignments.

    Instructors

    Articles

    Student Community: Where Questions Find Answers

    Ask and get expert answers on exams, counselling, admissions, careers, and study options.