Conference Papers
Year : 2000
Maxime Crochemore : Connect in order to contact the contributor
https://hal.science/hal-00619993
Submitted on : Wednesday, September 7, 2011-9:44:24 AM
Last modification on : Friday, March 24, 2023-2:52:54 PM
Dates and versions
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