1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
|
Description: Fix spelling
Author: Andreas Tille <tille@debian.org>
Last-Update: Wed, 10 Oct 2018 12:49:34 +0200
--- a/kissreads_graph/KissReadsGraph.cpp
+++ b/kissreads_graph/KissReadsGraph.cpp
@@ -35,7 +35,7 @@ void print_usage_and_exit(char * name){
fprintf (stderr, "With option \"-t modify\": outputs the same simplified graph:\n");
fprintf (stderr, "\t removing low covered edges and nodes (less that min_coverage)\n");
fprintf (stderr, "\t then phasing simple non branching paths\n");
- fprintf (stderr, "If -M option is specified, the input is considered as a Mapsembler output - thus composed of multiple independant graphes\n");
+ fprintf (stderr, "If -M option is specified, the input is considered as a Mapsembler output - thus composed of multiple independent graphes\n");
fprintf (stderr, "\nMANDATORY\n");
--- a/mapsembler2_extend/IterativeExtensions.cpp
+++ b/mapsembler2_extend/IterativeExtensions.cpp
@@ -178,7 +178,7 @@ void IterativeExtensions::construct_line
revcomp_sequence(kmer_seq,sizeKmer);
if (debug)
- printf(" --- iteration: kmer %s%s (of lenght %d) depth %d nbNodes explored %lli ---\n",kmer_seq,strand?" (internally rc)":"", (int)strlen(kmer_seq), depth,nbNodes);
+ printf(" --- iteration: kmer %s%s (of length %d) depth %d nbNodes explored %lli ---\n",kmer_seq,strand?" (internally rc)":"", (int)strlen(kmer_seq), depth,nbNodes);
// right extension
int len_right = traversal->traverse(kmer,right_traversal,strand);
@@ -397,7 +397,7 @@ void IterativeExtensions::construct_line
revcomp_sequence(kmer_seq,sizeKmer);
if (debug)
- printf("iteration: kmer %s%s (of lenght %zu) depth %d nbNodes explored %lli\n",kmer_seq,strand?" (internally rc)":"", strlen(kmer_seq), depth,nbNodes);
+ printf("iteration: kmer %s%s (of length %zu) depth %d nbNodes explored %lli\n",kmer_seq,strand?" (internally rc)":"", strlen(kmer_seq), depth,nbNodes);
// right extension
int len_right = traversal->traverse(kmer,right_traversal,strand);
|