Computing minimum length representations of sets of words of uniform length (Q2355702)
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: Computing minimum length representations of sets of words of uniform length |
scientific article; zbMATH DE number 6463994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum length representations of sets of words of uniform length |
scientific article; zbMATH DE number 6463994 |
Statements
Computing minimum length representations of sets of words of uniform length (English)
0 references
24 July 2015
0 references
algorithms on strings
0 references
combinatorics on words
0 references
graph theory
0 references
partial words
0 references
subwords
0 references
representable sets
0 references
0.9966156482696532
0 references
0.8521830439567566
0 references
0.8501974940299988
0 references
0.8500151038169861
0 references
0.830714225769043
0 references
