Efficient Computation of Hairpin Completion Distance: A Tight Lower Bound

The hairpin completion distance between two strings is the minimum number of hairpin completion operations required to transform one string into the other. This paper shows that computing the hairpin completion distance has a tight quadratic-time lower bound, assuming the Strong Exponential Time Hypothesis.