31 search results - page 1 / 7 » Involutively Bordered Words |
IJFCS
2007
13 years 10 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...
EJC
2008
13 years 11 months ago
2008
MST
2010
13 years 9 months ago
2010
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
SIAMDM
2010
13 years 9 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...