Deterministic polynomial-time algorithms for designing short DNA words

DOI10.1016/J.TCS.2012.12.030zbMATH Open1297.92057OpenAlexW2951680371MaRDI QIDQ391100FDOQ391100

Yong Zhang, Henry Leung, He Sun, Ming-Yang Kao

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)

Cites Work

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

Cited In (5)

• Algorithms for testing that sets of DNA words concatenate without secondary structure
• Title not available (Why is that?)
• Greedy construction of DNA codes and new bounds
• Randomized fast design of short DNA words
• Computational and Information Science

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391100)