A practical algorithm to find the best subsequence patterns (Q1870541)
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: A practical algorithm to find the best subsequence patterns |
scientific article; zbMATH DE number 1909894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practical algorithm to find the best subsequence patterns |
scientific article; zbMATH DE number 1909894 |
Statements
A practical algorithm to find the best subsequence patterns (English)
0 references
14 May 2003
0 references
optimal pattern discovery
0 references
subsequence
0 references
subsequence automata
0 references
0.7646608352661133
0 references
0.7497052550315857
0 references
0.7456417679786682
0 references
