lecture_notes:04-20-2015
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
lecture_notes:04-20-2015 [2015/04/25 02:58] calef [Meraculous algorithm] |
lecture_notes:04-20-2015 [2015/04/25 02:59] calef [Meraculous limitations] |
||
|---|---|---|---|
| Line 16: | Line 16: | ||
| * Searches unaligned reads as potential gap-closers using mate-pair data | * Searches unaligned reads as potential gap-closers using mate-pair data | ||
| =====Meraculous limitations===== | =====Meraculous limitations===== | ||
| - | * The assembler relies on data with high quality in order to avoid error correction | + | * The assembler relies on data with high quality in order to avoid error correction, also requires high coverage |
| * Initial release did not support polyploid genome assembly due to allowing for linear subgraphs of the de Bruijn graph only | * Initial release did not support polyploid genome assembly due to allowing for linear subgraphs of the de Bruijn graph only | ||
| - | * Low memory footprint | + | * High disk space usage |
| =====User experience===== | =====User experience===== | ||
| * Requires an array of other scripts in other languages | * Requires an array of other scripts in other languages | ||
lecture_notes/04-20-2015.txt ยท Last modified: 2015/04/25 03:07 by calef
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
