bx.intervals.operations.join module

Join two sets of intervals using their overlap as the key. The intervals MUST be sorted by chrom(lexicographically), start(arithmetically) and end(arithmetically). This works by simply walking through the inputs in O(n) time.

bx.intervals.operations.join.findintersect(interval, sortedlist, mincols)

bx.intervals.operations.join.findoverlap(a, b)

bx.intervals.operations.join.interval_cmp(a, b)

bx.intervals.operations.join.join(leftSet, rightSet, mincols=1, leftfill=True, rightfill=True)