Dipartimento di Matematica e Fisica “E. De Giorgi”, Università del Salento, Italy Istituto Nazionale di Fisica Nucleare sez. di Lecce, Lecce, Italy Dipartimento di Fisica, Università di Bari, Italy Istituto Nazionale di Fisica Nucleare sez. di Bari, Genova, Italy Dipartimento di Fisica, Università di Genova, Italy f Istituto Nazionale di Fisica Nucleare sez. di Genova, Genova, Italy Dipartiment...

This paper presents a minimal and complete set of structural refactoring rules for the Object-Z specification language that allow for the derivation of arbitrary object-oriented architectures. The rules are equivalence preserving and work in concert with existing class refinement theory, so that any design derived using the rule set can be shown to be equivalent to, or a refinement of, the orig...

The availability of a large number of complete genome sequences raises the question of how many genes are essential for cellular life. Trying to reconstruct the core of the protein-coding gene set for a hypothetical minimal bacterial cell, we have performed a computational comparative analysis of eight bacterial genomes. Six of the analyzed genomes are very small due to a dramatic genome size r...

In this article, we provide a constructive procedure to generate a spanning tree for any graph from its dominating set, γ set. We introduce a new kind of minimum dominating set and hence generate a minimum weighted spanning tree from a γ set for G. We also provide a method for generating a minimum weighted spanning tree using adjacency matrix of G. Key–Words: Spanning tree, Minimum dominating s...

We present an algorithm that solves the Minimal Set Cover prob lem within the framework of a surface based model of computation A xing DNA strands to a solid surface reduces the possibility of error resulting from the loss of DNA strands in solution An algorithm solving the Minimal Set Cover problem has previously been proposed using the sticker model of DNA computation Roweis We show that by t...