Reporting consecutive substring occurrences under bounded gap constraints (Q294948)
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: Reporting consecutive substring occurrences under bounded gap constraints |
scientific article; zbMATH DE number 6594186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reporting consecutive substring occurrences under bounded gap constraints |
scientific article; zbMATH DE number 6594186 |
Statements
Reporting consecutive substring occurrences under bounded gap constraints (English)
0 references
16 June 2016
0 references
suffix trees
0 references
geometric data structures
0 references
heavy-path decomposition
0 references
pattern matching
0 references
0.9990694522857666
0 references
0.7859311103820801
0 references
0.7756267786026001
0 references
0.7390953302383423
0 references
