Skip to Main content Skip to Navigation
Conference papers

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

Maxime Crochemore 1 Costas S. Iliopoulos Yoan J. Pinzon James Reid 
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Conference papers
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00619993
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Wednesday, September 7, 2011 - 9:44:24 AM
Last modification on : Saturday, January 15, 2022 - 3:57:13 AM

Identifiers

  • HAL Id : hal-00619993, version 1

Collections

ENPC | UPEC-UPEM | CNRS | UNIV-MLV | LIGM_ALGO | PARISTECH | LIGM

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

38