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. |
||
|---|---|---|
| .. | ||
| commandline | ||
| gatk | ||
| jna | ||
| utils | ||
| BaseTest.java | ||
| ExampleToCopyUnitTest.java | ||
| MD5DB.java | ||
| MD5Mismatch.java | ||
| StingTextReporter.java | ||
| TestNGTestTransformer.java | ||
| WalkerTest.java | ||