Fast algorithms for finding disjoint subsequences with extremal densities (Q850123): Difference between revisions
From MaRDI portal
Latest revision as of 22:54, 24 June 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