Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem.

•We study the use of an ILP model for the longest arc-preserving subsequence problem.•Heuristically reducing the model size leads to good results for artificial instances.•We also propose a hybrid algorithm that makes use of the ILP model.•Real world instances are best solved with the hybrid algorithm.•We empirically show the reasons for obtaining these results.