contributors:team_1_page
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
contributors:team_1_page [2015/05/03 23:41] jennie [Programs used] |
contributors:team_1_page [2015/05/04 04:42] jennie [Team composition] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Team composition===== | =====Team composition===== | ||
| - | | Name | Email| | + | | Name | Email | |
| | Charles Cole | chkcole@ucsc.edu | | | Charles Cole | chkcole@ucsc.edu | | ||
| | Jake Houser | jdhouser@ucsc.edu | | | Jake Houser | jdhouser@ucsc.edu | | ||
| Line 16: | Line 16: | ||
| After selecting a k-mer set, Meraculous produces a set of maximal linear sub-paths of the deBruijn graph. This process avoids an explicit error correction step used in other assemblers, instead relying on base quality scores. It then aligns reads to the assembly in order to identify useful read-pair information. Next, it uses paired-reads and splinting singletons to produce a scaffolding by “ordering and orienting” a set of contigs. Finally, gaps are closed using paired-end placements. | After selecting a k-mer set, Meraculous produces a set of maximal linear sub-paths of the deBruijn graph. This process avoids an explicit error correction step used in other assemblers, instead relying on base quality scores. It then aligns reads to the assembly in order to identify useful read-pair information. Next, it uses paired-reads and splinting singletons to produce a scaffolding by “ordering and orienting” a set of contigs. Finally, gaps are closed using paired-end placements. | ||
| - | =====Programs used===== | + | =====Other programs used===== |
| ===GCC=== | ===GCC=== | ||
contributors/team_1_page.txt · Last modified: 2015/07/18 20:29 by ceisenhart
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
