Fast algorithms for finding disjoint subsequences with extremal densities (Q850123)
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: Fast algorithms for finding disjoint subsequences with extremal densities |
scientific article; zbMATH DE number 5072635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for finding disjoint subsequences with extremal densities |
scientific article; zbMATH DE number 5072635 |
Statements
Fast algorithms for finding disjoint subsequences with extremal densities (English)
0 references
15 November 2006
0 references
holes in data
0 references
range prediction
0 references
protein torsion angle
0 references
protein structure prediction
0 references
dynamic programming
0 references
selection algorithms
0 references
time complexity
0 references
0.9779903292655944
0 references
0.8337188959121704
0 references
0.8325884938240051
0 references
0.8090248703956604
0 references
