Watson-Crick palindromes in DNA computing (Q5962061): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DNASequenceGenerator / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-009-9131-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132853600 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62046607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computational Properties of Template-Guided DNA Recombination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopalindrome closure operators in free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Structures Defined by DNA Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In Search of Optimal Codes for DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding properties of DNA languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Involution Solid and Join Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: INVOLUTIVELY BORDERED WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watson-Crick Conjugate and Commutative Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sticky-free and overhang-free DNA languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Structures in DNA Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The syntactic monoid of hairpin-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-roots of words and their properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Compact Proofreading for Self-assembled Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(d\)-minimal languages / rank
 
Normal rank

Latest revision as of 05:58, 3 July 2024

scientific article; zbMATH DE number 5786447
Language Label Description Also known as
English
Watson-Crick palindromes in DNA computing
scientific article; zbMATH DE number 5786447

    Statements

    Watson-Crick palindromes in DNA computing (English)
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    theoretical DNA computing
    0 references
    DNA encodings
    0 references
    combinatorics of words
    0 references
    palindromes
    0 references
    Watson-Crick palindromes
    0 references
    0 references
    0 references