RICERCA ITALIANA     

Programmi di ricerca simili:

• 1 - Sistemi e calcoli di ispirazione biologica e loro applicazioni -- BISCA

Classificazione scientifico-disciplinare

• Area scientifico disciplinare: Scienze matematiche e informatiche
  • INFORMATICA

Classificazione brevettuale

• CHEMISTRY; METALLURGY
  • BIOCHEMISTRY; BEER; SPIRITS; WINE; VINEGAR; MICROBIOLOGY; ENZYMOLOGY; MUTATION OR GENETIC ENGINEERING
    • APPARATUS FOR ENZYMOLOGY OR MICROBIOLOGY (installation for fermenting manure A01C3/02; preservation of living parts of humans or animals A01N1/02; physical or chemical apparatus in general B01; malting or mashing apparatus C12C1/00; brewing apparatus C12C13/00; fermentation apparatus for wine C12G; apparatus for preparing vinegar C12J1/10)
    • MEASURING OR TESTING PROCESSES INVOLVING ENZYMES OR MICRO-ORGANISMS (immunoassay G01N33/53); COMPOSITIONS OR TEST PAPERS THEREFOR; PROCESSES OF PREPARING SUCH COMPOSITIONS; CONDITION RESPONSIVE CONTROL IN MICROBIOLOGICAL OR ENZYMOLOGICAL PROCESSES
• PHYSICS
  • COMPUTING; CALCULATING; COUNTING (score computers for games A63; combinations of writing applicances with computing devices B43K29/08)
    • COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS [N0004]

Classificazione geografica

• Regione: Veneto

Bibliografia

[1] L. M. Adleman, Molecular Computation of solutions to combinatorial problems, Science, Vol. 266, pp. 1021-1024, Nov. 1994.
[2] D. Boneh et al., Making DNA computers error resistant, in [36], 163-170, 1999.
[3] S. Brainch, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, L. M. Adleman, Solutions of a Satisfiability Problem on a Gel-Based DNA Computer, 6th Int. Meeting on DNA Based Computers, Leiden Center for Natural Computing, A. Condon, G. Rozenberg (eds.), Leiden, 2000.
[4] C. Calude, Gh. Paun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.
[5] Cl. Ferretti, Mauri G., Paun G., Cl. Zandron, On Three Variants of P Systems with String-Objects, Pre-Proc. of Workshop on Membrane Computing, Curtea de Arges, Romania, Aug. 2001, TR 17/01, Rovira i Virgili University, Tarragona, Spain, 63-76, 2001.
[6] P. Frisco, Membrane Computing Based on Splicing: Improvements, Pre-proc. Workshop on Multiset Processing, Curtea de Arges, Romania, CDMTCS TR 140, Univ. of Auckland, 100-111, 2000.
[7] P. Frisco, On Two Variants of Splicing P Systems, Romanian J. of Information Science and Technology, 4, 1-2, 89-100, 2001.
[8] P. Frisco et al., A Direct Construction of a Universal P System, Pre-Proc. of Workshop on Membrane Computing, Curtea de Arges, Romania, Aug. 2001, TR17/01, Rovira i VirgiliUniversity, Tarragona, Spain, 89-106, 2001.
[9] M. R. Garey, Johnson D. S., Computers and Intractability, Freeman, San Francisco, 1979.
[10] J. Dassow J., Paun G., Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, 1989.
[11] T. Head, Chen X., Nichols M. J., Yamamura M., and Gal S., Aqueous Solutions of Algorithmic Problems: emphasizing knights on a 3x3, in [16], 219-230, 2001.
[12] T. Head, Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors, Bull. of Math. Biology, 49, 737-759, 1987.
[13] G. T.Herman, Rozenberg G., Developmental Systems and Languages, North-Holland, Amsterdam, 1975.
[14] L. Kari, Rozenberg G., Salomaa A., L Systems, in G. [36], Vol. II, 253-328, 1997.
[15] N. Jonoska, Karl S. A., Saito M., Three Dimensional DNA Structures in Computing, Biosystems, Vol. 52, 242-245, 1999.
[16] N. Jonoska, Seeman N. (eds.), 7th International Meeting on DNA Based Computers, Preliminary Proceedings, Tampa, U.S.A. (FL), 2001.
[17] L. Landweber, Baum E., DNA Based Computers II, DIMACS Series 44, AMS, Providence RI, 1999.
[18] R. Lipton, DNA Solutions of hard computational problems, Science, Vol. 218, PP. 218-217, 1996.
[19] V. Manca, String Rewriting and Metabolism: A Logical Perspective, in: Computing with Bio-molecules. Theory and Experiments, Paun G. (ed.), Springer-Verlag, Singapore, 36-60, 1998.
[20] V. Manca, Martino M. D., From String Rewriting to Logical Metabolic Systems, in: G. Paun, A. Salomaa (eds.), Grammatical Models of Multi-agent Systems, Gordon and Breach Science Publishers, Topics in Computer Mathematics, Vol. 8, London, 297-315, 1999.
[21] V. Manca, Martin-Vide C., Paun G., Iterated GSM Mappings: A Collapsing Hierarchy, in: Jewels Are Forever, Karhumaki J., Mauer H., Paun G., Rozenberg G. (eds.), pp.182-193, Springer-Verlag, Berlin, 1999.
[22] V. Manca, Martin-Vide C., Paun G., New Computing Paradigms Suggested by DNA Computing Computing by Carving, in: Biosystems, Vol. 52/1-3, pp. 47-54, 1999.
[23] V. Manca, Monoidal Systems and Membrane Systems, Pre-proc. of the Workshop on Multiset Processing, Curtea de Arges, Romania, August 2000, in: S. C. Calude, M. D. Dineen, G. Paun (eds.), Centre for Discrete Mathematics and Theoretical Compurer Science, University of Auckland, New Zealand, Aug. 2000.
[24] V. Manca, Monoidals for molecules and membranes, Romanian Journal of Information science and technology, Vol. 4, N. 1-2, pp. 155-170, 2001.
[25] V. Manca, and Di Gregorio S., Lizzari D., Vallini G., Zandron C., A DNA Algorithm for 3-SAT(11,20), in: [16], 167-178, 2001.
[26] V. Manca, Membrane Algorithms for Propositional Satisfiability, in Pre-proc. Workshop on Membrane Computing, Curtea de Arges, Romania, TR 17, Univ. Rovira i Virgili, Tarragona (Spain), 181-192, 2001.
[27] V. Manca, Logical string rewriting, Theoretical Computer Science, 264, 25-51, 2001.
[28] S. Marcus, Linguistic Structures and Generative Devices in Molecular Genetics, in: Cahier de Linguistique Theorique et Appliquee, Vol. 11, n. 2, 77-104, 1974.
[29] S. Marcus, Language at the Crossroad of Computation and Biology, in: Computing with Bio-molecules. Theory and Experiments, Paun G. (ed.), Springer-Verlag, Singapore, pp. 1-35, 1998.
[30] A. Nijholt and G. Scollo (Guest Editors), Theoretical Computer Science 199, 1-3 (1998), Special Issue on Algebraic Methods in Language Processing.
[31] A. Nijholt, G. Scollo and D. Heylen (Guest Editors), Theoretical Computer Science 293, 2 (2003), Special Issue on Algebraic Methods in Language Processing.
[32] G. Paun, Rozenberg G., Salomaa A;, DNA Computing: New Computing Paradigms, Springer-Verlag,Berlin, 1998.
[33] G. Paun, P Systems with Active Membranes: Attacking NP Complete Problems, J. AutomataLanguages and Combinatorics, 6, 1, 2001.
[34] G. Paun,, Computing with membranes, J. of Computer and System Science, 61, 1, 108-143, 2000.
[35] G. Rozenberg, Salomaa A.(eds.), Handbook of Language Theory, 3 Voll., Springer-Verlag, Berlin, Heidelberg, 1997.
[36] H. Rubin, Wood D., DNA Based Computers III, DIMACS Series 48, AMS, Providence RI, 1999.
[37] K. Sakamoto et al., State transitions by molecules,Biosystems, Vol. 52, pp. 81-91, 1999.
[38] K. Sakamoto et al., Molecular Computation by DNA Hairpin Formation, Science, Vol. 288, pp. 1223-1226, May 19, 2000.
[39] K. Selman, Kautz H., Cohen B., Local Search Strategies for Satisfiability Testing,in: Cliques,Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D. S. Johnson, M. A. Trick, eds., vol. 26, AMS, 1996.
[40] Y. Takenaka, Hashimoto A., A proposal of DNA computing on beads and its application to SAT problems, in [16], pp. 331-339, 2001.
[41] K.J. Turner and G. Scollo (Guest Editors), Computer Networks and ISDN Systems 29, 4 (1997), Special Issue on Specification Architecture.
[42] H. Yoshida and Suyama A., Solutions to 3-SAT by breadth first search, in cite{Winfree} pp. 9-22, 2000.
[43] M. Yamamoto at al., A study of hybridization process in DNA computing, in [45], pp. 101-110, 2000.
[44] E. Winfree E., Gifford D. K., DNA Based Computers V, DIMACS Series 54, AMS, Providence RI, 2000.
[45] Cl. Zandron, Mauri G., Ferretti CL., Universality and Normal Forms on Membrane Systems, Proc. Intern. Workshop Grammar Systems 2000 (R. Freund, A. Kelemenova, eds.), Bad Ischl, Austria, Jul. 2000, 61-74.
[46] Cl. Zandron, Ferretti CL., Mauri G., Solving NP-Complete Problems Using P Systems with Active Membranes, in vol. Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Springer-Verlag, London, 289-301, 2000.
[47] Cl. Zandron, Ferretti CL., Mauri G., Using Membrane Features in P Systems, Romanian J. of Information Science and Technology, 4, 1-2, 241-257, 2001.
[48] BERNARDINI F., MANCA V. (2003). Dynamical aspects of P systems. BIOSYSTEMS. vol. 70, pp. 85-93.
[49] BERNARDINI F, MANCA V. (2003). P systems with boundary rules. In PAUN G., ROZENBERG G., SALOMAA A., ZANDRON C. Membrane Computing WMC 2002. (pp. 107-118).
[50] FRANCO G., MANCA V. (2003). A membrane system for selective leukocyte recruitment. In ALHAZOV A., MARTIN-VIDE C., PAUN G. Membrane Computing WMC 2003. (pp. 189-189).
[51] FRANCO G., MANCA V. (2003). Modeling some biological phenomena by P systems. Workshop of European Molecular Computing Consortium. December2003.
[52] F. Fontana and G. Franco. Finding the maximum element using p systems, J. of Universal Computer Science, 2004. Accepted for publication.
[53] G. Franco, C. Giagulli, C. Laudanna, V. Manca, DNA Extraction by Cross-Pointing PCR. Accepted to DNA10, Milan, Italy, June 2004.

Parole Chiave

CALCOLO MOLECOLARE; CALCOLO DNA; ALGORITMI BIOMOLECOLARI; CODIFICHE DNA; SISTEMI A MEMBRANE; MODELLI CELLULARI DISCRETI; DINAMICHE SU STRINGHE; ALLINEAMENTO DI SEQUENZE