Sciweavers

74 search results - page 9 / 15
» dam 2007
Sort
View
DAM
2007
97views more  DAM 2007»
14 years 9 months ago
On Sturmian graphs
In this paper we define 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...
Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...
DAM
2007
72views more  DAM 2007»
14 years 9 months ago
Binary templates for comma-free DNA codes
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...
Oliver D. King, Philippe Gaborit
DAM
2007
60views more  DAM 2007»
14 years 9 months ago
Restricting SBH ambiguity via restriction enzymes
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...
Steven Skiena, Sagi Snir
DAM
2007
74views more  DAM 2007»
14 years 9 months ago
On the uniform edge-partition of a tree
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...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
DAM
2007
88views more  DAM 2007»
14 years 9 months ago
Digital planarity - A review
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...