Torrent Contents Size: 1.11 GB
Bioinformatics Algorithms [2013, ENG]
|
|
01 - Welcome
|
|
01 - Class Welcome Message (01-31)
|
|
|
02 - How to Sync a Coursera Account with Stepic (01-45)
|
|
|
03 - Screencast How to Solve Programming Assignments (04-39)
|
|
|
|
02 - Week 1 Where in the Genome Does DNA Replication Begin
|
|
01 - Search for Hidden Messages in Replication Origin (Part 1) (11-37)
|
|
|
02 - Search for Hidden Messages in Replication Origin (Part 2) (06-24)
|
|
|
03 - From a Biological Insight toward an Algorithm for Finding Replication Origin (Part 1) (09-05)
|
|
|
04 - From a Biological Insight toward an Algorithm for Finding Replication Origin (Part 2) (04-10)
|
|
|
05 - From a Biological Insight toward an Algorithm for Finding Replication Origin (Part 3) (05-55)
|
|
|
|
03 - Week 2 How Do We Sequence Antibiotics
|
|
01 - The Discovery of Antibiotics (04-10)
|
|
|
02 - How Do Bacteria Make Antibiotics (08-51)
|
|
|
03 - Sequencing Antibiotics by Shattering Them into Pieces (04-40)
|
|
|
04 - A Brute Force Algorithm for Cyclopeptide Sequencing (03-05)
|
|
|
05 - Cyclopeptide Sequencing with Branch and Bound (06-15)
|
|
|
06 - Adapting Sequencing for Spectra with Errors (07-40)
|
|
|
07 - From 20 to More than 100 Amino Acids (02-20)
|
|
|
08 - The Spectral Convolution Saves the Day (06-02)
|
|
|
09 - The Truth About Spectra (02-20)
|
|
|
10 - Open Problems (07-43)
|
|
|
|
04 - Week 3 Which DNA Patterns Play the Role of Molecular Clocks
|
|
01 - From Implanted Patterns to Regulatory Motifs (Part 1) (10-08)
|
|
|
02 - From Implanted Patterns to Regulatory Motifs (Part 2) (06-26)
|
|
|
03 - From Implanted Patterns to Regulatory Motifs (Part 3) (07-21)
|
|
|
04 - How Rolling Dice Helps Us Find Regulatory Motifs (Part 1) (12-42)
|
|
|
05 - How Rolling Dice Helps Us Find Regulatory Motifs (Part 2) (05-36)
|
|
|
06 - How Rolling Dice Helps Us Find Regulatory Motifs (Part 3) (07-45)
|
|
|
|
05 - Week 4 How Do We Assemble Genomes (Part 1)
|
|
01 - Field Trip Kaliningrad (04-12)
|
|
|
02 - What Is Genome Sequencing
|
|
|
03 - Exploding Newspapers
|
|
|
04 - The String Reconstruction Problem
|
|
|
05 - String Reconstruction as a Hamiltonian Path Problem
|
|
|
06 - String Reconstruction as an Eulerian Path Problem
|
|
|
07 - Similar Problems with Different Algorithmic Fates
|
|
|
08 - De Bruijn Graphs
|
|
|
09 - Eulers Theorem
|
|
|
|
06 - Week 5 How Do We Assemble Genomes (Part 2)
|
|
01 - Assembling Read-Pairs
|
|
|
02 - De Bruijn Graphs Face Harsh Realities of Assembly
|
|
|
03 - Field Trip Kaliningrad (Part 2) (01-39)
|
|
|
|
07 - Week 6 How Do We Compare Biological Sequences (Part 1)
|
|
01 - From Sequence Comparison to Biological Insights (10-02)
|
|
|
02 - The Alignment Game and the Longest Common Subsequence Problem (03-45)
|
|
|
03 - The Manhattan Tourist Problem (06-14)
|
|
|
04 - The Change Problem (10-20)
|
|
|
05 - Dynamic Programming and Backtracking Pointers (06-58)
|
|
|
06 - From Manhattan to the Alignment Graph (09-41)
|
|
|
07 - From Global to Local Alignment (11-12)
|
|
|
|
08 - Week 7 How Do We Compare Biological Sequences (Part 2)
|
|
01 - Penalizing Insertions and Deletions in Sequence Alignment (05-27)
|
|
|
02 - Space-Efficient Sequence Alignment (10-36)
|
|
|
03 - Multiple Sequence Alignment (13-04)
|
|
|
|
09 - Week 8 Are There Fragile Regions in the Human Genome
|
|
01 - Transforming Men into Mice (13-11)
|
|
|
02 - Sorting By Reversals (04-20)
|
|
|
03 - Breakpoint Theorem (05-58)
|
|
|
04 - Rearrangements in Tumor Genomes (05-18)
|
|
|
05 - 2-Breaks (07-16)
|
|
|
06 - Breakpoint Graphs (06-33)
|
|
|
07 - 2-Break Distance Theorem (05-11)
|
|
|
08 - Rearrangement Hotspots in the Human Genome (07-55)
|
|
|
09 - Synteny Block Construction (11-00)
|
|
|
|
10 - Week 9 How Do We Locate Disease-Causing Mutations
|
|
01 - Why Do We Map Reads
|
|
|
02 - Using the Trie
|
|
|
03 - From a Trie to a Suffix Tree
|
|
|
|
11 - Week 10 How Do We Locate Disease-Causing Mutations (Part 2)
|
|
01 - String Compression and the Burrows-Wheeler Transform
|
|
|
02 - Inverting Burrows-Wheeler
|
|
|
03 - Using Burrows-Wheeler for Pattern Matching
|
|
|
04 - Finding the Matched Patterns
|
|
|
05 - Setting Up Checkpoints
|
|
|
06 - Inexact Matching
|
|
|
07 - Further Applications of Read Mapping
|
|
Description
Related Torrents
Trackers
| Tracker name |
| http://bt4.t-ru.org/ann?magnet |
| http://bt1.t-ru.org/ann |
| http://bt2.t-ru.org/ann |
| http://bt4.t-ru.org/ann |
| udp://tracker.opentrackr.org:1337 |
| udp://open.stealth.si:80/announce |
| udp://tracker.torrent.eu.org:451/announce |
| udp://exodus.desync.com:6969 |
| udp://open.demonii.com:1337/announce |
| udp://tracker.coppersurfer.tk:6969 |
| udp://p4p.arenabg.com:1337 |
| udp://tracker.internetwarriors.net:1337 |
Torrent hash:
Copied!