An inexact-suffix-tree-based algorithm for detecting extensible patterns (Q1781986)
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 inexact-suffix-tree-based algorithm for detecting extensible patterns |
scientific article; zbMATH DE number 2174867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An inexact-suffix-tree-based algorithm for detecting extensible patterns |
scientific article; zbMATH DE number 2174867 |
Statements
An inexact-suffix-tree-based algorithm for detecting extensible patterns (English)
0 references
10 June 2005
0 references
Pattern discovery
0 references
Motif discovery
0 references
Data mining
0 references
Flexible patterns
0 references
Extensible patterns
0 references
Motifs
0 references
Suffix trees
0 references
0.7315540909767151
0 references
0.7281156182289124
0 references
0.7205415368080139
0 references
