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

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

Journal articles

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

Maxime Crochemore ¹ Costas S. Iliopoulos Yoan J. Pinzon James Reid

1 ligm - Laboratoire d'Informatique Gaspard-Monge

Document type :

Journal articles

Domain :

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

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

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

Identifiers

Collections

Citation

Export

Metrics

152

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

Identifiers

Collections

Citation

Export

Share

Metrics

152