On the far from most string problem, one of the hardest string selection problems (Q5253264)
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 6443056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the far from most string problem, one of the hardest string selection problems |
scientific article; zbMATH DE number 6443056 |
Statements
On the Far from Most String Problem, One of the Hardest String Selection Problems (English)
0 references
4 June 2015
0 references
computational biology
0 references
molecular structure prediction
0 references
string selection
0 references
consensus
0 references
combinatorial optimization
0 references
metaheuristics
0 references
0.8255848288536072
0 references
0.8122409582138062
0 references
0.8101484775543213
0 references
0.7771879434585571
0 references
