Deterministic polynomial-time algorithms for designing short DNA words

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

Authors Ming-Yang Kao, Henry Leung, He Sun, 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)

Recommendations

• Deterministic polynomial-time algorithms for designing short DNA words
• Randomized fast design of short DNA words
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1568800
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Cites work

• scientific article; zbMATH DE number 1953221 (Why is no real title available?)
• scientific article; zbMATH DE number 1738639 (Why is no real title available?)
• Bounds for DNA codes with constant GC-content
• Complexities for Generalized Models of Self-Assembly
• Deterministic polynomial-time algorithms for designing short DNA words
• Flexible Word Design and Graph Labeling
• Linear constructions for DNA codes
• On codeword design in metric DNA spaces
• Randomized fast design of short DNA words
• Strand design for biomolecular computation.

Cited in

(10)

• Testing whether a set of code words satisfies a given set of constraints
• Deterministic polynomial-time algorithms for designing short DNA words
• scientific article; zbMATH DE number 1568800 (Why is no real title available?)
• EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH
• Automata, Languages and Programming
• Algorithms for testing that sets of DNA words concatenate without secondary structure
• Greedy construction of DNA codes and new bounds
• Flexible Word Design and Graph Labeling
• Computational and Information Science
• Randomized fast design of short DNA words

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)