Testing whether a set of code words satisfies a given set of constraints

MaRDI QIDQ3105285zbMATH OpenFDO

Authors Hsin-Wen Wei, Wan-Chen Lu, Pei-Chi Huang, Wei-Kuan Shih, Ming-Yang Kao

Publication date 5 January 2012

zbMATH Keywords

Hamming distanceenumerationDNA wordstable lookup

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Edit metric codes with combinatorial DNA constraints
• An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
• Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
• Deterministic polynomial-time algorithms for designing short DNA words
• Automata, Languages and Programming

This page was built for publication: Testing whether a set of code words satisfies a given set of constraints

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