-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #129 from NuttyLogic/prosper
Prosper
- Loading branch information
Showing
17 changed files
with
781 additions
and
43 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -284,7 +284,7 @@ void wgsim_core(const char *fn, int is_hap, uint64_t N, int dist, int std_dev, i | |
s[0] = size[0]; s[1] = size[1]; | ||
|
||
// generate the read sequences | ||
target = rseq[0].s; // haplotype from which the reads are generated | ||
target = rseq[drand48()<0.5?0:1].s; // haplotype from which the reads are generated | ||
n_sub[0] = n_sub[1] = n_indel[0] = n_indel[1] = n_err[0] = n_err[1] = 0; | ||
int start[2] = {pos, pos + insert_size + size_l}; | ||
int end[2] = {start[0], start[1]}; | ||
|
@@ -477,7 +477,7 @@ void wgsim_core(const char *fn, int is_hap, uint64_t N, int dist, int std_dev, i | |
static int simu_usage() | ||
{ | ||
fprintf(stderr, "\n"); | ||
fprintf(stderr, "Forked wgsim (Heng Li) (short read simulator) for simulation of bisuflite treated reads\n"); | ||
fprintf(stderr, "Forked wgsim (Heng Li) (short read simulator) for simulation of bisulfite treated reads\n"); | ||
fprintf(stderr, "Version: %s\n", PACKAGE_VERSION); | ||
fprintf(stderr, "Contact: Colin Farrell <[email protected]>\n\n"); | ||
fprintf(stderr, "Usage: wgsim [options] <in.ref.fa> \n\n"); | ||
|
@@ -492,7 +492,7 @@ static int simu_usage() | |
fprintf(stderr, " -X FLOAT probability an indel is extended [%.2f]\n", INDEL_EXTEND); | ||
fprintf(stderr, " -S INT seed for random generator [-1]\n"); | ||
fprintf(stderr, " -A FLOAT disgard if the fraction of ambiguous bases higher than FLOAT [%.2f]\n", MAX_N_RATIO); | ||
fprintf(stderr, " -h haplotype mode\n"); | ||
fprintf(stderr, " -h INT haplotype mode\n"); | ||
fprintf(stderr, "\n"); | ||
return 1; | ||
} | ||
|
@@ -507,7 +507,7 @@ int main(int argc, char *argv[]) | |
N = 1000000; dist = 500; std_dev = 50; | ||
mean_insert = (dist - size_l * 2) / 2; | ||
size_l = size_r = 70; | ||
while ((c = getopt(argc, argv, "e:d:s:N:1:2:r:R:hX:S:A:I:")) >= 0) { | ||
while ((c = getopt(argc, argv, "e:d:s:N:1:2:r:R:h:X:S:A:I:")) >= 0) { | ||
switch (c) { | ||
case 'd': dist = atoi(optarg); break; | ||
case 's': std_dev = atoi(optarg); break; | ||
|
@@ -520,7 +520,7 @@ int main(int argc, char *argv[]) | |
case 'X': INDEL_EXTEND = atof(optarg); break; | ||
case 'A': MAX_N_RATIO = atof(optarg); break; | ||
case 'S': seed = atoi(optarg); break; | ||
case 'h': is_hap = 1; break; | ||
case 'h': is_hap = atoi(optarg); break; | ||
case 'I': mean_insert = atoi(optarg); break; | ||
} | ||
} | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.