Fast algorithms for finding a minimum repetition representation of strings and trees (Q2446339)
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 6286052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for finding a minimum repetition representation of strings and trees |
scientific article; zbMATH DE number 6286052 |
Statements
Fast algorithms for finding a minimum repetition representation of strings and trees (English)
0 references
16 April 2014
0 references
tandem repeat
0 references
string algorithm
0 references
labeled ordered trees
0 references
0.7831029891967773
0 references
0.7704418897628784
0 references
0.7552475929260254
0 references
0.7538459897041321
0 references
