Efficient algorithms for finding interleaving relationship between sequences (Q2380070): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:37, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding interleaving relationship between sequences |
scientific article |
Statements
Efficient algorithms for finding interleaving relationship between sequences (English)
0 references
24 March 2010
0 references
design of algorithms
0 references
bioinformatics
0 references
dynamic programming
0 references
longest common subsequence
0 references
merged sequence
0 references
