An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827)
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 efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence |
scientific article; zbMATH DE number 5172682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence |
scientific article; zbMATH DE number 5172682 |
Statements
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (English)
0 references
19 July 2007
0 references
Motif
0 references
Maximal motif
0 references
Data mining
0 references
Sequence mining
0 references
Algorithm
0 references
Delay
0 references
Enumeration
0 references
Polynomial time
0 references
Closed itemset
0 references
Closed pattern
0 references
Pattern discovery
0 references
0 references
0 references
0.85335296
0 references
0.8498241
0 references
0.8425272
0 references
0.8388336
0 references
0.83877224
0 references
