Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

We will use the information you provide on this form to be in touch with you about news and events at the Barcelona School of Economics. Please check this box below so we can send you this information. You can change your mind at any time by clicking the unsubscribe link in the footer of any email you receive from us, or by contacting us at community@bse.eu. We will treat your information with respect. For more information about our privacy practices please visit our website. By clicking below, you agree that we may process your information in accordance with these terms.