You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It'd be good to be able to "adjust" the span of edges so as to remove missing sites, that are ubiquitous in real data. It's typical for these exclusion masks to contain very many small intervals -- e.g. small indel sized -- that would dramatically increase the number of edges if removed via TreeSequence.delete_intervals. From a runtime perspective I think it'd be much quicker to use an efficient algorithm for intersecting sorted intervals.
The text was updated successfully, but these errors were encountered:
It'd be good to be able to "adjust" the span of edges so as to remove missing sites, that are ubiquitous in real data. It's typical for these exclusion masks to contain very many small intervals -- e.g. small indel sized -- that would dramatically increase the number of edges if removed via
TreeSequence.delete_intervals
. From a runtime perspective I think it'd be much quicker to use an efficient algorithm for intersecting sorted intervals.The text was updated successfully, but these errors were encountered: