UCSanDiegoX: Graph Algorithms in Genome Sequencing
|
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.
About this course
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:
How do we sequence a genome?
How do we construct an evolutionary “Tree of Life?”
In the first part of the course, you will learn how genome sequencing relies on using a graph to assemble millions of tiny DNA fragments into a contiguous genome. We will then shift gears and learn how to construct an evolutionary tree of life from genome data.
At a Glance:
Institution: UCSanDiegoX
Subject: Computer Science
Level: Intermediate
Prerequisites:
Basic knowledge of:
at least one programming language: loops, arrays, stacks, recursion.
mathematics: proof by induction, proof by contradiction.
Language: English
Video Transcript: English
Associated programs:
MicroMasters® Program in Algorithms and Data Structures
Associated skills:Algorithms, Biology, Graph Algorithms, Whole Genome Sequencing, Data Structures
What You’ll Learn:
About this course
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:
How do we sequence a genome?
How do we construct an evolutionary “Tree of Life?”
In the first part of the course, you will learn how genome sequencing relies on using a graph to assemble millions of tiny DNA fragments into a contiguous genome. We will then shift gears and learn how to construct an evolutionary tree of life from genome data.
User Reviews
Be the first to review “UCSanDiegoX: Graph Algorithms in Genome Sequencing”
Related Products
HarvardX: CS50’s Introduction to Artificial Intelligence with Python
Learn to use machine learning in Python in this introductory course on artificial intelligence.
GTx: Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps
Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps that utilize key-value pairs to store data. Explore probabilistic data structures like SkipLists. Course tools help visualize the structures and performance.
GTx: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.
DartmouthX, IMTx: C Programming: Language Foundations
Master foundational concepts in the C programming language such as logical statements and arrays.
ETHx: Self-Driving Cars with Duckietown
Self-Driving Cars with Duckietown is the first robotics and AI MOOC with scale-model self-driving cars. Learn state-of-the-art autonomy hands-on: build your own real robot (Duckiebot) and get it to drive autonomously in your scaled city (Duckietown).
There are no reviews yet.