A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast and practical bit-vector algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 1771822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and practical bit-vector algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 1771822 |
Statements
A fast and practical bit-vector algorithm for the longest common subsequence problem (English)
0 references
25 July 2002
0 references
longest common subsequence
0 references
0 references
