We now run Smith-Waterman on the dangling tail against the corresponding reference tail. If we can generate a reasonable, low entropy alignment then we trigger the merge to the reference path; otherwise we abort. Also, we put in a check for low-complexity of graphs and don't let those pass through. Added tests for this implementation that checks exact SW results and correct edges added. |
||
|---|---|---|
| .. | ||
| AlignmentUtilsUnitTest.java | ||
| ArtificialBAMBuilderUnitTest.java | ||
| ArtificialPatternedSAMIteratorUnitTest.java | ||
| ArtificialSAMFileWriterUnitTest.java | ||
| ArtificialSAMQueryIteratorUnitTest.java | ||
| ArtificialSAMUtilsUnitTest.java | ||
| ArtificialSingleSampleReadStreamUnitTest.java | ||
| GATKSAMRecordUnitTest.java | ||
| MisencodedBaseQualityUnitTest.java | ||
| ReadUtilsUnitTest.java | ||