z-logo
open-access-imgOpen Access
Exemplar Longest Common Subsequence (extended abstract)
Author(s) -
Paola Bonizzoni,
Gianluca Della Vedova,
Riccardo Dondi,
Guillaume Fertin,
Stéphane Vialette
Publication year - 2006
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - subsequence , longest common subsequence problem , disjoint sets , combinatorics , longest increasing subsequence , generalization , bounded function , set (abstract data type) , mathematics , symbol (formal) , discrete mathematics , algorithm , theoretical computer science , computer science , mathematical analysis , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom