Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

Algorithms for Computing Variants of the Longest Common Subsequence Problem

Iliopoulos, Costas S. and Rahman, M. Sohel (2006) Algorithms for Computing Variants of the Longest Common Subsequence Problem. In: Proceedings of the 17th International Symposium on Algorithms and Computation.

Full text not available from this repository.


Item Type:Conference or Workshop Item (Paper)
Subjects:UNSPECIFIED
ID Code:1166
Deposited By:Professor Michael Luck
Deposited On:14 Nov 2007 10:39
Last Modified:14 Nov 2007 10:39

Repository Staff Only: item control page