Bwa Alignments With Gaps
I am looking for a description of bwa algorithm for mapping with gaps. More precisely I wonder how bwa handles mismatches in reads with gaps. Does it have the same maximum mismatches allowed than when there is no gaps? Does someone know where I can find a cleared description of bwa gapped alignment algorithm?
Thanks
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
How Does Bwa Report Multi-Mapped Reads
written by bbio
-
Does The Mapping Of A Read'S Pair Affect Its Own Mapping Score In Bwa?
written by jhrf •
-
Bwa : Allow Low Stringency In Alignments
written by Nicolas Rosewick
-
Bwa Index Output And Bwa Aln Problem
written by Tonyzeng •
-
What Causes The Bwa Error: "Assertion `Re - Rb == Rlen' Failed."
written by Cacau
-
Whole Genome Sequencing: Bwa
written by mathiasf52 •
-
Bwa Commands
written by shilpy •
-
Mapping Quality Issues With Bwa/Stampy Hybrid Alignment
written by oadaily •
-
Bwa Alignment: Gap Vs Soft-Clipped Sequences
written by michealsmith
-
Clarification For Running Bwa In Parallel
written by Mohamed •
There are three alignment algorithms within bwa. Do you mean "bwa aln" (backtrack), "bwa bwasw" (bwa smith-waterman), or "bwa mem" (maximal-exact-matching)? I assume the first since you are talking about "maximum mismatches". I would suggest reading Heng Li's original BWA paper and post specific questions.