Universal DNA tag systems: a combinatorial design scheme
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Introduction to Coding Theory
Strand design for biomolecular computation
Theoretical Computer Science - Natural computing
Complexities for generalized models of self-assembly
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
Linear constructions for DNA codes
Theoretical Computer Science
Hybrid randomised neighbourhoods improve stochastic local search for DNA code design
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Randomized fast design of short DNA words
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Randomized fast design of short DNA words
ACM Transactions on Algorithms (TALG)
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science
| Hi-index | 0.00 |
Motivated by emerging applications for DNA code word design, we consider a generalization of the code word design problem in which an input graph is given which must be labeled with equal length binary strings of minimal length such that the Hamming distance is small between words of adjacent nodes and large between words of non-adjacent nodes. For general graphs we provide algorithms that bound the word length with respect to either the maximum degree of any vertex or the number of edges in either the input graph or its complement. We further provide multiple types of recursive, deterministic algorithms for trees and forests, and provide an improvement for forests that makes use of randomization.