Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem (Q4932075): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:04, 5 March 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
