At the moment, we have the following ideas with regards to window size:
---try several options (e.g. -/+500 b, -/+200 b, -/+800 b) and then evaluate how these perform with metric by majority
The optimal solution would be to have varying window sizes, boundaries at locations with greatest coverage. How can we implement this? Any better algorithms come to mind? At the moment, this is a linear search algorithm, and would be the bottleneck for this code.
At the moment, we have the following ideas with regards to window size:
---try several options (e.g. -/+500 b, -/+200 b, -/+800 b) and then evaluate how these perform with metric by majority
The optimal solution would be to have varying window sizes, boundaries at locations with greatest coverage. How can we implement this? Any better algorithms come to mind? At the moment, this is a linear search algorithm, and would be the bottleneck for this code.