Deterministic polynomial-time algorithms for designing short DNA words

DOI10.1016/J.TCS.2012.12.030zbMath1297.92057OpenAlexW2951680371MaRDI QIDQ391100

Henry C. M. Leung, He Sun, Ming-Yang Kao, Yong Zhang

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.030

zbMATH Keywords

Hamming distancebasic Hamming constraintbiologically motivated constraintsderandomization techniquesDNA wordsshifting Hamming constraint

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (1)

Greedy construction of DNA codes and new bounds

Cites Work

• Unnamed Item
• Unnamed Item
• On codeword design in metric DNA spaces
• Bounds for DNA codes with constant GC-content
• Linear constructions for DNA codes
• Strand design for biomolecular computation.
• Randomized fast design of short DNA words
• Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
• Complexities for Generalized Models of Self-Assembly
• Flexible Word Design and Graph Labeling

This page was built for publication: Deterministic polynomial-time algorithms for designing short DNA words