BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A simple algorithm for the constrained sequence problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast and practical bit-vector algorithm for the longest common subsequence problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Speeding up transposition-invariant string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for finding interleaving relationship between sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic programming algorithms for the mosaic longest common subsequence problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The constrained longest common subsequence problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for computing a longest common increasing subsequence / rank | |||
Normal rank | |||
Latest revision as of 18:10, 8 July 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
