User Tools

Site Tools


lecture_notes:04-13-2011

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
lecture_notes:04-13-2011 [2011/04/15 12:22]
eyliaw [De Bruijn Graphs]
lecture_notes:04-13-2011 [2015/08/20 02:46] (current)
217.73.208.146 ↷ Links adapted because of a move operation
Line 1: Line 1:
 ====== Velvet, Dan Zerbino ====== ====== Velvet, Dan Zerbino ======
 ===== De Bruijn Graphs ===== ===== De Bruijn Graphs =====
-[[bioinformatic_tools:​velvet|Velvet]] uses de Bruijn graphs to condense reads and resolve common sequencing problems. ​ Compared to overlap layout consensus, it simplifies multiple reads by resolving repeats into only one node, so that their counts only need to be stored on top.  This reduces the amount of memory required to store the reads by the dimension of coverage.+[[archive:bioinformatic_tools:​velvet|Velvet]] uses de Bruijn graphs to condense reads and resolve common sequencing problems. ​ Compared to overlap layout consensus, it simplifies multiple reads by resolving repeats into only one node, so that their counts only need to be stored on top.  This reduces the amount of memory required to store the reads by the dimension of coverage.
  
 Specifically,​ the de Bruijn graph breaks each read into words and paths through the words, mapping new reads to form a graph structure. ​ Velvet then simplifies this graph by removing unjoined tips and reducing parallel strands into the strand with the maximum coverage (this error corrects for mismatched bases). ​ Velvet leaves loops unresolved in the final structure, as these represent repeat regions. [(cite:​Velvet>​Zerbino,​ D. and Birney, E. Specifically,​ the de Bruijn graph breaks each read into words and paths through the words, mapping new reads to form a graph structure. ​ Velvet then simplifies this graph by removing unjoined tips and reducing parallel strands into the strand with the maximum coverage (this error corrects for mismatched bases). ​ Velvet leaves loops unresolved in the final structure, as these represent repeat regions. [(cite:​Velvet>​Zerbino,​ D. and Birney, E.
Line 7: Line 7:
 ===== Extensions ===== ===== Extensions =====
 ==== Shorty ==== ==== Shorty ====
-Shorty uses the variance in paired read lengths to build larger contigs from small ones.  It bears some resemblence to how [[bioinformatic_tools:​PRICE|PRICE]] does contig extension.+Shorty uses the variance in paired read lengths to build larger contigs from small ones.  It bears some resemblence to how [[archive:bioinformatic_tools:​price|PRICE]] does contig extension.
 ==== Oasis ==== ==== Oasis ====
 Oasis does splicing analysis on words with more than one connection, breaking them up into separate contigs. ​ This resolves nodes in the de Bruijn graph. Oasis does splicing analysis on words with more than one connection, breaking them up into separate contigs. ​ This resolves nodes in the de Bruijn graph.
 ==== Columbus ==== ==== Columbus ====
 Columbus is a combined approach between mapping and de novo sequencing. ​ It uses a reference sequence to organize contigs, but allows for novel structures within the contigs. Columbus is a combined approach between mapping and de novo sequencing. ​ It uses a reference sequence to organize contigs, but allows for novel structures within the contigs.
lecture_notes/04-13-2011.1302895374.txt.gz · Last modified: 2011/04/15 12:22 by eyliaw