From 6ea3f132219a97ef2e4714e4b0ab443fcff06367 Mon Sep 17 00:00:00 2001 From: Eduard Valera i Zorita Date: Fri, 2 Feb 2018 11:03:36 +0100 Subject: [PATCH] Removes PE_FASTQ conditional branch before printing clusters in spheres. Always prints matched sequence. Closes #18. --- src/starcode.c | 9 ++------- 1 file changed, 2 insertions(+), 7 deletions(-) diff --git a/src/starcode.c b/src/starcode.c index 780b402..cc02abb 100644 --- a/src/starcode.c +++ b/src/starcode.c @@ -426,12 +426,7 @@ starcode for (int k = 0 ; k < hits->nitems ; k++) { useq_t *match = (useq_t *) hits->items[k]; if (match->canonical != u) continue; - if (FORMAT == PE_FASTQ) { - fprintf(OUTPUTF1, ",%s", match->seq); - } - else { - fprintf(OUTPUTF1, ",%s", u->seq); - } + fprintf(OUTPUTF1, ",%s", match->seq); } } } @@ -1040,7 +1035,7 @@ sphere_clustering if (useq->canonical != NULL) continue; useq->canonical = useq; if (useq->matches == NULL) continue; - // Bidirectional edge references simplifies the algorithm. + // Bidirectional edge references simplifie the algorithm. // Directly proceed to claim neighbor counts. gstack_t *matches; for (int j = 0 ; (matches = useq->matches[j]) != TOWER_TOP ; j++) {