This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
contributors:team_3:merging_indexes [2015/04/20 19:35] chkan created |
contributors:team_3:merging_indexes [2015/07/28 06:01] (current) ceisenhart ↷ Page moved from merging_indexes to contributors:team_3:merging_indexes |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | [code] | + | <code> |
- | Distributed construction of an FM index from multiple input files | + | |
- | jts edited this page on May 26, 2011 · 1 revision | + | **Distributed construction of an FM index from multiple input files** |
- | Pages 11 | + | |
- | Home | + | |
- | ASQG Format | + | |
- | Distributed construction of an FM index from multiple input files | + | |
- | Example assembly workflow | + | |
- | FAQ | + | |
- | Indexing large data sets | + | |
- | Parameter tuning | + | |
- | Preqc | + | |
- | Scaffolding multiple libraries | + | |
- | SGA Design | + | |
- | sga subprograms | + | |
- | Clone this wiki locally | + | |
- | Clone in Desktop | ||
If your data sets consists of multiple files, you can construct the FM-index for each file separately then merge the indices together to obtain an index of the entire data. This requires much less memory than constructing an index from a single file containing the entire data set. For example, suppose your data consists of four files: | If your data sets consists of multiple files, you can construct the FM-index for each file separately then merge the indices together to obtain an index of the entire data. This requires much less memory than constructing an index from a single file containing the entire data set. For example, suppose your data consists of four files: | ||
Line 40: | Line 26: | ||
sga correct -p final s_2_1.fastq | sga correct -p final s_2_1.fastq | ||
sga correct -p final s_2_2.fastq | sga correct -p final s_2_2.fastq | ||
- | [/code] | + | </code> |