Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-30698-8_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing