On finding minimal, maximal, and consistent sequences over a binary alphabet (Q673107)
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 985377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding minimal, maximal, and consistent sequences over a binary alphabet |
scientific article; zbMATH DE number 985377 |
Statements
On finding minimal, maximal, and consistent sequences over a binary alphabet (English)
0 references
28 February 1997
0 references
complexity
0 references
longest minimal common supersequence
0 references
shortest maximal common subsequence
0 references
shortest maximal common non-supersequence
0 references
binary alphabet
0 references
0.8672642
0 references
0 references
0.8631129
0 references
0.8611356
0 references
0.8567294
0 references
