Faster subsequence and don't-care pattern matching on compressed texts (Q3011864)
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 5915011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster subsequence and don't-care pattern matching on compressed texts |
scientific article; zbMATH DE number 5915011 |
Statements
Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (English)
0 references
29 June 2011
0 references
0.8205217719078064
0 references
0.8164523839950562
0 references
0.7923619747161865
0 references
