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

Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata

Iliopoulos, Costas S. and Rahman, M. Sohel and Voracek, M. and Vagner, L. (2007) Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata. In: Proceedings of the 3rd Algorithms and Complexity in Durham Workshop. (Unpublished)

Full text not available from this repository.


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

Repository Staff Only: item control page