Skip to Main content Skip to Navigation
Journal articles

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

Document type :
Journal articles
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00619572
Contributor : Maxime Crochemore <>
Submitted on : Tuesday, September 6, 2011 - 3:52:08 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM

Identifiers

  • HAL Id : hal-00619572, 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. Information Processing Letters, Elsevier, 2001, 80 (6), pp.279-285. ⟨hal-00619572⟩

Share

Metrics

Record views

152