Binary templates for comma-free DNA codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1284434 (Why is no real title available?)
- scientific article; zbMATH DE number 1284438 (Why is no real title available?)
- scientific article; zbMATH DE number 1953219 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- scientific article; zbMATH DE number 3055095 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Combinatorial problems motivated by comma‐free codes
- Comma-Free Codes
- DNA sequence design using templates
- Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Regent Results in Comma-Free Codes
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
This page was built for publication: Binary templates for comma-free DNA codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876480)