Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming algorithms for the mosaic longest common subsequence problem |
scientific article; zbMATH DE number 5664786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming algorithms for the mosaic longest common subsequence problem |
scientific article; zbMATH DE number 5664786 |
Statements
Dynamic programming algorithms for the mosaic longest common subsequence problem (English)
0 references
29 January 2010
0 references
bioinformatics
0 references
mosaic sequence
0 references
design of algorithms
0 references
0.9038724
0 references
0.9025954
0 references
0 references
0 references
0.8940194
0 references
0.8937185
0 references
0.89290416
0 references
