Aspects of Molecular Computing
Editat de Natasha Jonoska, Gheorghe P¿un, Grzegorz Rozenbergen Limba Engleză Paperback – 16 dec 2003
The book presents a unique and authorative state-of-the-art survey on current research in molecular computing: 30 papers by leading researchers in the area are drawn together on the occasion of the 70th birthday of Tom Head, a pioneer in molecular computing. Among the topics addressed are molecular tiling, DNA self-assembly, splicing systems, DNA-based cryptography, DNA word design, gene assembly, and membrane computing.
Preț: 382.98 lei
Puncte Express: 574
Carte tipărită la comandă
Livrare economică 13-27 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540207818
ISBN-10: 3540207813
Pagini: 408
Ilustrații: XII, 396 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540207813
Pagini: 408
Ilustrații: XII, 396 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Solving Graph Problems by P Systems with Restricted Elementary Active Membranes.- Writing Information into DNA.- Balance Machines: Computing = Balancing.- Eilenberg P Systems with Symbol-Objects.- Molecular Tiling and DNA Self-assembly.- On Some Classes of Splicing Languages.- The Power of Networks of Watson-Crick D0L Systems.- Fixed Point Approach to Commutation of Languages.- Remarks on Relativisations and DNA Encodings.- Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems.- Digital Information Encoding on DNA.- DNA-based Cryptography.- Splicing to the Limit.- Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs.- n-Insertion on Languages.- Transducers with Programmable Input by DNA Self-assembly.- Methods for Constructing Coded DNA Languages.- On the Universality of P Systems with Minimal Symport/Antiport Rules.- An Algorithm for Testing Structure Freeness of Biomolecular Sequences.- On Languages of Cyclic Words.- A DNA Algorithm for the Hamiltonian Path Problem Using Microfluidic Systems.- Formal Languages Arising from Gene Repeated Duplication.- A Proof of Regularity for Finite Splicing.- The Duality of Patterning in Molecular Genetics.- Membrane Computing: Some Non-standard Ideas.- The P Versus NP Problem Through Cellular Computing with Membranes.- Realizing Switching Functions Using Peptide-Antibody Interactions.- Plasmids to Solve #3SAT.- Communicating Distributed H Systems with Alternating Filters.
Notă biografică
EDUCATION: PhD June 1, 1993 Department of Mathematical Sciences, SUNY at Binghamton Title: Synchronizing Representations of Sofic Systems; Fall 1988 - Spring 1993 Graduate course work at SUNY Binghamton; Spring 1985 - Spring 1987 Graduate course work at University of Belgrade; Fall 1980 - Fall 1984: B.S. in Mathematics and Computer Science University 'Kiril i Metodij' - Skopje Skopje, Macedonia. Graduation: October 31, 1984. Graduation thesis: The Word Problem in Groups.
POSITIONS HELD: Fall 1998 - present: Associate Professor at the University of South Florida, Tampa Florida. Fall 1993 - Spring 1998: Assistant Professor at the University of South Florida, Tampa Florida. January 1993 - August 1993: Research Assistant at SUNY-Binghamton, supported by the NSF grant CCR-9201345 Summer 1989, Summer 1990 - Fall 1992: Teaching Assistant, Dept. of Math. Sciences, SUNY-Binghamton; Fall 1988 - Spring 1990: Grading Assistant, Dept. Math. Sciences, SUNY-Binghamton, April 1985 - June 1988: Full time employment as assistant, Faculty of Natural and Mathematical Sciences, University 'Kiril i Metodij'-Skopje (Macedonia).
AWARDS AND MEMBERSHIPS: DNA Computation of Complex Problems Research and Creative Scholarship Award, Division of Sponsored Research USF; January 1993 - August 1993 Supported by the NSF grant CCR-9201345 at SUNY Binghamton.
Best graduating student of the year 1984; Faculty of Natural and Mathematical Sciences at the University 'Kiril i Metodij' - Skopje.
Professors Paun and Rozenberg have published/edited quite a number of Springer books in the past years.
POSITIONS HELD: Fall 1998 - present: Associate Professor at the University of South Florida, Tampa Florida. Fall 1993 - Spring 1998: Assistant Professor at the University of South Florida, Tampa Florida. January 1993 - August 1993: Research Assistant at SUNY-Binghamton, supported by the NSF grant CCR-9201345 Summer 1989, Summer 1990 - Fall 1992: Teaching Assistant, Dept. of Math. Sciences, SUNY-Binghamton; Fall 1988 - Spring 1990: Grading Assistant, Dept. Math. Sciences, SUNY-Binghamton, April 1985 - June 1988: Full time employment as assistant, Faculty of Natural and Mathematical Sciences, University 'Kiril i Metodij'-Skopje (Macedonia).
AWARDS AND MEMBERSHIPS: DNA Computation of Complex Problems Research and Creative Scholarship Award, Division of Sponsored Research USF; January 1993 - August 1993 Supported by the NSF grant CCR-9201345 at SUNY Binghamton.
Best graduating student of the year 1984; Faculty of Natural and Mathematical Sciences at the University 'Kiril i Metodij' - Skopje.
Professors Paun and Rozenberg have published/edited quite a number of Springer books in the past years.
Caracteristici
Provides an up-to-date insight into current research on theory of molecular computing The list of contributors includes some of the best known researchers in the area of molecular computing Includes supplementary material: sn.pub/extras