Open GoogleCodeExporter opened 9 years ago
Thanks for using cutadapt! Your suggestion sounds reasonable, but I can
probably not implement it in exactly that way. I'm wondering how you do the
trimming: Do you just compare the read lengths and remove the extra bases from
the longer one if the lengths differ? I'd like to keep the promise that an
adapter is removed only if the error rate with which is was found is below the
specified threshold.
What I could do instead is to add some logic so either both reads or none are
trimmed. So if the adapter is found only in one of the reads, the adapter is
not removed at all. Compared to what you suggest, fewer read pairs would be
trimmed, but then the obvious solution to that would be to increase the maximum
error rate.
I should also point out issue 81, reported just yesterday, where the reporter
uses a paired-read merging tool to merge the reads prior to adapter trimming.
Don't know if that's the way to go.
I'm a bit busy with other things now, so it may take me a while to get this or
something like it implemented.
Original comment by marcel.m...@tu-dortmund.de
on 8 Oct 2014 at 7:58
Original issue reported on code.google.com by
ctorr...@googlemail.com
on 8 Oct 2014 at 4:46