On the Logic and Geometry of Bilinear Forms

Authors:
Vincenzo Manca
Affiliations:
Università di Verona, Dipartimento di Informatica, Ca' Vignal 2, Strada Le Grazie, 15 - 37134 Verona, Italy. vincenzo.manca@univr.it (Corresp.)
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2004

Citing 2
Cited 3

A Clause String DNA Algorithm for SAT

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
An algorithmic analysis of DNA structure

Soft Computing - A Fusion of Foundations, Methodologies and Applications

Computing by Floating Strings

Electronic Notes in Theoretical Computer Science (ENTCS)
A DNA computing inspired computational model

Theoretical Computer Science
Algorithmic applications of XPCR

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The double stranded structure of DNA molecules is investigated in an abstract setting. Only the general structure of bilinear strings is taken into account regardless of specific physical and biochemical aspects of DNA molecules. In this context, the principles which DNA processes are based on are formulated in an abstract form. Surprisingly enough, some intrinsic features of DNA molecules turn out to be implied by these general principles.