Efficient algorithms for finding interleaving relationship between sequences (Q2380070)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for finding interleaving relationship between sequences |
scientific article; zbMATH DE number 5686497 |
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
0 references
0.7799913883209229
0 references
0.7538961172103882
0 references
0.7498612999916077
0 references
0.7482971549034119
0 references
0.7480401396751404
0 references
