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

Document type :
Conference papers
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619993
Contributor : Maxime Crochemore <>
Submitted on : Wednesday, September 7, 2011 - 9:44:24 AM
Last modification on : Wednesday, April 11, 2018 - 12:12:02 PM

Identifiers

  • HAL Id : hal-00619993, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

89