BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:06, 5 March 2024
scientific article; zbMATH DE number 6313575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM |
scientific article; zbMATH DE number 6313575 |
Statements
BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (English)
0 references
4 July 2014
0 references
sequence comparison
0 references
merged longest common subsequence
0 references
bit-parallelism
0 references
