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 the Longest Parameterized Common Subsequence

Iliopoulos, Costas S. and Kubica, M. and Rahman, M. Sohel and Walen, T. (2007) Algorithms for Computing the Longest Parameterized Common Subsequence. In: Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching.

Full text not available from this repository.


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

Repository Staff Only: item control page