310 search results - page 43 / 62 » dam 2008 |
DAM
2007
13 years 10 months ago
2007
Arita and Kobayashi proposed a method for constructing comma-free DNA codes using binary templates, and showed that the separation d of any such binary template of length n satisļ...
DAM
2007
13 years 10 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
DAM
2007
13 years 10 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ā¤ n. The objective is to minimize the ratio of the maximu...
DAM
2007
13 years 10 months ago
2007
In this paper we deļ¬ne Sturmian graphs and we prove that all of them have a certain ācountingā property. We show deep connections between this counting property and two conj...
DAM
2007
13 years 10 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...