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

A New Efficient Algorithm for computing the Longest Common Subsequence

Rahman, M. Sohel and Iliopoulos, Costas S. (2007) A New Efficient Algorithm for computing the Longest Common Subsequence. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management.

Full text not available from this repository.


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

Repository Staff Only: item control page