An upper bound on the hardness of exact matrix based motif discovery (Q925067)
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: An upper bound on the hardness of exact matrix based motif discovery |
scientific article; zbMATH DE number 5280792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the hardness of exact matrix based motif discovery |
scientific article; zbMATH DE number 5280792 |
Statements
An upper bound on the hardness of exact matrix based motif discovery (English)
0 references
29 May 2008
0 references
motif discovery
0 references
computational complexity
0 references
combinatorics
0 references
transcription factor binding site prediction
0 references
string algorithm
0 references
0.9997084736824036
0 references
0.8045427799224854
0 references
0.7915538549423218
0 references
0.7740270495414734
0 references
0.7734599113464355
0 references
