Computer Science – Data Structures and Algorithms
Scientific paper
2012-01-30
Computer Science
Data Structures and Algorithms
27 pages
Scientific paper
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. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that applied heuristic local searches, genetic algorithms, and randomized algorithms. In particular, Kao, Sanghi, and Schweller (2009) developed polynomial-time randomized algorithms to construct n DNA words of length within a multiplicative constant of the smallest possible word length (e.g., 9 max{log n, k}) that satisfy various sets of constraints with high probability. In this paper, we give deterministic polynomial-time algorithms to construct DNA words based on derandomization techniques. Our algorithms can construct n DNA words of shorter length (e.g., 2.1 log n + 6.28 k) and satisfy the same sets of constraints as the words constructed by the algorithms of Kao et al. Furthermore, we extend these new algorithms to construct words that satisfy a larger set of constraints for which the algorithms of Kao et al. do not work.
Kao Ming-Yang
Leung Henry C. M.
Sun He
Zhang Yong
No associations
LandOfFree
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Deterministic Polynomial-Time Algorithms for Designing Short DNA Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Polynomial-Time Algorithms for Designing Short DNA Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-360520