{"repository":{"description":"Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. This project provides an efficient Python implementation of a deterministic polynomial-time algorithm for DNA Word Design described in \"Deterministic Polynomial-time Algorithms fro Designing Short DNA Words\" by Kao et al.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":84,"owner":"truongduy134","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-08-06T22:52:32-07:00","pushed_at":"2013-08-15T00:56:28-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Nguyen Truong Duy","company":"National University of Singapore","location":"Singapore","email":"532e6a4e7dfca46996a91c186f9ba645c0a05c92@yahoo.com"},"url":"https://github.com/truongduy134/DNA-Word-Design/wiki/Designing-Words-for-C1-through-C7"}