Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (Q4932075): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3233/fi-2010-256 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1566604942 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 30 July 2024
scientific article; zbMATH DE number 5794266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem |
scientific article; zbMATH DE number 5794266 |
Statements
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (English)
0 references
1 October 2010
0 references
constrained longest common subsequence
0 references
longest common subsequence
0 references
dynamic programming
0 references
bit-parallel algorithm
0 references
