An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words

DOI10.1007/978-3-642-33860-1_11MaRDI QIDQ4649276zbMATH OpenOpenAlexWikidataFDO

Authors Michelangelo Cianciulli, Rocco Zaccagnino, Rosalba Zizza

Publication date 21 November 2012

Published in Theory and Practice of Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33860-1_11

zbMATH Keywords

codesDNA codeword design problemDNA computingfinite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Testing DNA code words properties of regular languages
• scientific article; zbMATH DE number 1933226
• DNA Codes and Their Properties
• Algorithms for testing that sets of DNA words concatenate without secondary structure
• scientific article; zbMATH DE number 1953217

Cited in

(7)

• Algorithms for testing that sets of DNA words concatenate without secondary structure
• Testing whether a set of code words satisfies a given set of constraints
• Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
• scientific article; zbMATH DE number 1933226 (Why is no real title available?)
• scientific article; zbMATH DE number 1953217 (Why is no real title available?)
• On a test for codes
• Testing DNA code words properties of regular languages

This page was built for publication: An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words

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