Abstract

AbstractRecently a new interest towards the design of efficient algorithms for testing whether a language X is a code, has arisen from (wet) DNA Computing. Indeed, in this context, the final computation is a concatenation of DNA strands (words) that must satisfy some restrictions (DNA properties) to prevent them from interacting in undesirable ways. Efficient algorithms (and implementations) have been designed when X is a finite set. In this paper we provide an algorithm (and a Java implementation) for testing whether an infinite but regular set of words is a code that avoids some unwanted cross hybridizations. The algorithm runs in O(n 2), where n is the sum of the numbers of states and transitions in a finite state automaton recognizing X.KeywordsDNA codeword design problemDNA ComputingCodesFinite State Automata

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.