INNER CODE UNIT · Python
last
cbg-ethz/V-pipe · workflow/scripts/alignmentIntervals.py:168
last = intervals_merged[-1]
# Test for overlap between current interval and the last one.
# We know that last[0] <= interval[0]
if interval[0] <= last[1]:
upper_bound = max(last[1], interval[1])
intervals_merged[-1] = (last[0], upper_bound)
else:
intervals_merged.append(interval)
return intervals_merged
def find_intersect(intervals_new, intervals_old):
intervals_intersected = []
for i_new in intervals_new:
for i_old in intervals_old:
lower_bound = max(i_old[0], i_new[0])
upper_bound = min(i_old[1], i_new[1])