Media Summary: We discuss dynamic programming algorithms related to edit distance: global alignment and local alignment. Course page: ... We discuss two ways that sequencing technology can help us overcome the problems posed by repetitive DNA. Course page: ... We discuss how repetitive DNA can make the Eulerian walk assembly approach give incorrect answers. Course page: ...

Ads1 Practical Finding And Representing - Detailed Analysis & Overview

We discuss dynamic programming algorithms related to edit distance: global alignment and local alignment. Course page: ... We discuss two ways that sequencing technology can help us overcome the problems posed by repetitive DNA. Course page: ... We discuss how repetitive DNA can make the Eulerian walk assembly approach give incorrect answers. Course page: ... We discuss graphs and a specific kind of graph we can use to

Photo Gallery

ADS1: Practical: Finding and representing all overlaps
ADS1: Practical: Matching real reads
ADS1: Practical: Matching artificial reads
ADS1: Practical: Overlaps between pairs of reads
ADS1: Practical: Implementing shortest common superstring
ADS1: Practical: Implementing greedy shortest common superstring
ADS1: Meet the family: global and local alignment
ADS1: The future is long?
ADS1: When Eulerian walks go wrong
ADS1: Overlap graphs
Wheeler graphs, part 5: Data structures
View Detailed Profile
ADS1: Practical: Finding and representing all overlaps

ADS1: Practical: Finding and representing all overlaps

In this

ADS1: Practical: Matching real reads

ADS1: Practical: Matching real reads

In this

ADS1: Practical: Matching artificial reads

ADS1: Practical: Matching artificial reads

In this

ADS1: Practical: Overlaps between pairs of reads

ADS1: Practical: Overlaps between pairs of reads

In this

ADS1: Practical: Implementing shortest common superstring

ADS1: Practical: Implementing shortest common superstring

In this

ADS1: Practical: Implementing greedy shortest common superstring

ADS1: Practical: Implementing greedy shortest common superstring

In this

ADS1: Meet the family: global and local alignment

ADS1: Meet the family: global and local alignment

We discuss dynamic programming algorithms related to edit distance: global alignment and local alignment. Course page: ...

ADS1: The future is long?

ADS1: The future is long?

We discuss two ways that sequencing technology can help us overcome the problems posed by repetitive DNA. Course page: ...

ADS1: When Eulerian walks go wrong

ADS1: When Eulerian walks go wrong

We discuss how repetitive DNA can make the Eulerian walk assembly approach give incorrect answers. Course page: ...

ADS1: Overlap graphs

ADS1: Overlap graphs

We discuss graphs and a specific kind of graph we can use to

Wheeler graphs, part 5: Data structures

Wheeler graphs, part 5: Data structures

We use bitvectors and wavelet trees to