DNA Computing
From MaRDI portal
Publication:5494358
DOI10.1007/b136914zbMath1116.68462OpenAlexW4248466611MaRDI QIDQ5494358
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136914
Related Items
On del-robust primitive words ⋮ Watson-Crick Partial Words ⋮ Testing primitivity on partial words ⋮ Compatibility relations on codes and free monoids ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ An algorithmic toolbox for periodic partial words ⋮ Relational codes of words ⋮ Freeness of partial words ⋮ Defect theorems with compatibility relations. ⋮ Unavoidable sets of partial words ⋮ Overlap-freeness in infinite partial words ⋮ Testing avoidability on sets of partial words is hard ⋮ The theorem of Fine and Wilf for relational periods