A fast and practical bit-vector algorithms for the longest common subsequence problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2000

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

Costas S. Iliopoulos
  • Function : Author
Yoan J. Pinzon
  • Function : Author
James Reid
  • Function : Author
No file

Dates and versions

hal-00619993 , version 1 (07-09-2011)

Identifiers

  • HAL Id : hal-00619993 , version 1

Cite

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, James Reid. A fast and practical bit-vector algorithms for the longest common subsequence problem. Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000, 2000, Australia. pp.75-86. ⟨hal-00619993⟩
37 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More