We implement a very simple approach. Each read is searched for the junction adapter (CTGTCTCTTATACACATCT) and its reverse complement (AGATGTGTATAAGAGACAG) based on Hamming distance, the entire junction being CTGTCTCTTATACACATCT+AGATGTGTATAAGAGACAG. If a match to either side of the junction is found then the entire 38bp juncton is clipped. This means the algorithm can tolerate an indel error in one of the sides of the junction, but not both. Optionally Smith-Waterman alignment can be turned on with -w which resolves this issue, although the code is less tested.
eg. this will be caught:
CTGTCTCT-TA-TACACATCTAGATGTGTATAAGAGACAG
but not this:
CTGTCTCT-TA-TACACATCTAGATGT-GTATAAGAGACAG
Follow adapter trimmer
Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of adapter trimmer!