Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 033 (Word design) — Constraint detection

This problem has its roots in Bioinformatics and Coding Theory . Problem : find as large a set S of strings -LRB- words -RRB- of length 8 over the alphabet W = -LCB- A , C , G , T -RCB- with the following properties : Each word in S has 4 symbols from -LCB- C , G -RCB- ; Each pair of distinct words in S differ in at least 4 positions ; and Each pair of words x and y in S -LRB- where x and y may be identical -RRB- are such that xR and yC differ in at least 4 positions . Here , -LRB- x1 , - , x8 -RRB- R = -LRB- x8 , - , x1 -RRB- is the reverse of -LRB- x1 , - , x8 -RRB- and -LRB- y1 , - , y8 -RRB- C is the Watson-Crick complement of -LRB- y1 , - , y8 -RRB- , i.e. the word where each A is replaced by a T and vice versa and each C is replaced by a G and vice versa .

Problem 033 (Word design) — Detection of the decisions and objects to be modeled

This problem has its roots in Bioinformatics and Coding Theory . Problem : find as large a set S of strings -LRB- words -RRB- of length 8 over the alphabet W = -LCB- A , C , G , T -RCB- with the following properties : Each word in S has 4 symbols from -LCB- C , G -RCB- ; Each pair of distinct words in S differ in at least 4 positions ; and Each pair of words x and y in S -LRB- where x and y may be identical -RRB- are such that xR and yC differ in at least 4 positions . Here , -LRB- x1 , - , x8 -RRB- R = -LRB- x8 , - , x1 -RRB- is the reverse of -LRB- x1 , - , x8 -RRB- and -LRB- y1 , - , y8 -RRB- C is the Watson-Crick complement of -LRB- y1 , - , y8 -RRB- , i.e. the word where each A is replaced by a T and vice versa and each C is replaced by a G and vice versa .

Back to list