An algorithm for distinguishing efficiently bit-strings by their subsequences (Q758204)
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 algorithm for distinguishing efficiently bit-strings by their subsequences |
scientific article; zbMATH DE number 4195180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for distinguishing efficiently bit-strings by their subsequences |
scientific article; zbMATH DE number 4195180 |
Statements
An algorithm for distinguishing efficiently bit-strings by their subsequences (English)
0 references
1991
0 references
shortest subsequence
0 references
factorizing strings
0 references
