scientific article; zbMATH DE number 1953221
From MaRDI portal
Publication:4414683
zbMath1026.68564MaRDI QIDQ4414683
Dan Tulpan, Holger H. Hoos, Anne Condon
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2568/25680229.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Deterministic polynomial-time algorithms for designing short DNA words ⋮ Unnamed Item ⋮ Watson-Crick powers of a word ⋮ Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing ⋮ TTT plots: a perl program to create time-to-target plots ⋮ Linear constructions for DNA codes ⋮ DNA codes over finite local Frobenius non-chain rings of length 4 ⋮ Watson-Crick palindromes in DNA computing ⋮ On conflict free DNA codes ⋮ Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
This page was built for publication:
