Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The previous mappability filter was a bit rough in how it addressed mappability, as it only really addressed if a read could uniquely map when starting at a given position. This doesn't really tell about how all the potential reads that can cross a position can map to it. Now the filter uses pileup mappability (see reference below), which averages the mappability of all possible k-mers overlapping a position. This should be more appropriate for telling how well a position can be mapped to with short read data. Setting K to a value close to historical DNA fragment sizes will hopefully make sure that modern and historical samples are getting fairly compared.
Fast Computation and Applications of Genome Mappability - Scientific Figure on ResearchGate. Available from: https://www.researchgate.net/figure/Pileup-mappability-The-number-of-all-possible-k-mers-covering-a-particular-position-of_fig4_221776385 [accessed 8 Dec, 2023]