A fast and practical bit-vector algorithms for the longest common subsequence problem

Crochemore, Maxime; Iliopoulos, Costas S.; Pinzon, Yoan J.; Reid, James

by Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, James Reid

Reference:

A fast and practical bit-vector algorithms for the longest common subsequence problem (Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, James Reid), In IPL, volume 80, 2001.

Bibtex Entry:

@ARTICLE{CIP01BitVectorLCS,
  author	= "Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinzon and James Reid",
  title		= "A fast and practical bit-vector algorithms for the longest common subsequence problem",
  journal	= IPL,
  year		= "2001",
  volume	= "80",
  pages		= "279--285",
  number	= "6"
}