Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798)
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 5382267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time |
scientific article; zbMATH DE number 5382267 |
Statements
Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (English)
0 references
12 December 2008
0 references
design and analysis of algorithms
0 references
pattern matching
0 references
motif discovery
0 references
irredundant motif
0 references
base
0 references
0.9287604689598083
0 references
0.9065864086151124
0 references
0.7980780601501465
0 references
0.7795970439910889
0 references
0.7795915603637695
0 references
