Testing whether a set of code words satisfies a given set of constraints (Q3105285)
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: Testing whether a set of code words satisfies a given set of constraints |
scientific article; zbMATH DE number 5995010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing whether a set of code words satisfies a given set of constraints |
scientific article; zbMATH DE number 5995010 |
Statements
5 January 2012
0 references
Hamming distance
0 references
DNA words
0 references
enumeration
0 references
table lookup
0 references
0.7235020995140076
0 references
0.7013536691665649
0 references
0.699106752872467
0 references
0.698070228099823
0 references
0.696287214756012
0 references
