Is there a data structure that supports O(1) subsequence deletion and insertion

Question

I was looking for a way to optimize strings so that you could delete contiguous segments in them faster than Θ(n) since I would be doing a lot of removal operations and my c