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 fast and practical bit-vector algorithms for the longest common subsequence problem

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. and Reid, James (2001) A fast and practical bit-vector algorithms for the longest common subsequence problem. Information Processing Letters, 80 (6). pp. 279-285.

Full text not available from this repository.


Item Type:Article
Subjects:UNSPECIFIED
ID Code:663
Deposited By:Prof Maxime Crochemore
Deposited On:26 Nov 2007 17:46
Last Modified:26 Nov 2007 17:47

Repository Staff Only: item control page