Fast algorithms for finding disjoint subsequences with extremal densities (Q850123): 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.patcog.2006.01.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117142730 / rank | |||
Normal rank | |||
Revision as of 20:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for finding disjoint subsequences with extremal densities |
scientific article |
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
