Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.

Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier

Browse the full CPM paper archive.