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 Algorithm for the Longest Common Subsequence Problem

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. and Reid, J. F. (2001) A Fast and Practical Bit-Vector Algorithm 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:1140
Deposited By:Professor Michael Luck
Deposited On:13 Nov 2007 18:26
Last Modified:13 Nov 2007 18:26

Repository Staff Only: item control page