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 Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000 (L. Brankovic, J. Ryan, eds.), University of Newcastle, NSW, Australia, 2000.

Bibtex Entry:

@INPROCEEDINGS{CIP00BitVectorLCS,
  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",
  booktitle	= "Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000",
  year		= "2000",
  editor	= "L. Brankovic and J. Ryan",
  pages		= "75--86",
  publisher	= "University of Newcastle, NSW, Australia"
}