A fast and practical bit-vector algorithm for the longest common subsequence problem
type: Item
instance of: scholarly article
title: A fast and practical bit-vector algorithm for the longest common subsequence problem
zbMATH Open document ID: 1003.68201
DOI: 10.1016/S0020-0190(01)00182-X
author: Maxime Crochemore
author: Costas S. Iliopoulos
author: Yoan Pinzón
author: James F. Reid
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1771822
zbMATH Keywords: longest common subsequence
Wikidata QID: Q61677962
MaRDI profile type: Publication
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: A bit-string longest-common-subsequence algorithm
cites work: Q3335786
cites work: A linear space algorithm for computing maximal common subsequences
cites work: An information-theoretic lower bound for the longest common subsequence problem
cites work: Q5528329
cites work: A subquadratic algorithm for approximate limited expression matching
cites work: A faster algorithm computing string edit distances
cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming
cites work: Q4144192
cites work: Shortcuts, diversions, and maximal chains in partially ordered sets
cites work: Q4509227
cites work: The String-to-String Correction Problem
cites work: Approximate string matching using withinword parallelism
description: scientific article; zbMATH DE number 1771822