37 search results - page 2 / 8 » Partial Words for DNA Coding |
IJFCS
2007
13 years 5 months ago
2007
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over th...
DLT
2007
13 years 7 months ago
2007
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
AI
2003
Springer
13 years 10 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
IANDC
2008
13 years 5 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
DAM
2007
13 years 5 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...