This document in subdirectoryRS/05/37/ Faster Algorithms for Computing Longest Common Increasing Subsequences

Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRIC