Efficient algorithms for finding interleaving relationship between sequences (Q2380070): 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.1016/j.ipl.2007.08.028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144662852 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 March 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
