Hi,I like to merge a bunch of intervals in case they overlap such that in the end any single point will be covered by at most interval.
At first glance it seems like IntervalTree or its underlying graph_impl_interval_tree would suit this task. Currently it however does not seem to provide all the functionality required. I can add new intervals and and lookup the intervals that overlap a query point/interval but apparently I have to add the merge myself by either working on the existing notes (extending existing intervals) or by removing the detected intervals and adding a new one covering both the removed and the query point/interval. Unfortunately, a removeInterval functionality is also not provided in the current implementation.
I'm wondering if there is another way to do this kind of task that I have missed. After all this task is a pretty common one so I figured there would be something suitable in seqan.
Best, Fabian -- Fabian Buske Institute for Molecular BioscienceThe University of Queensland Brisbane, Qld. 4072 Australia