PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 20

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  DNA computing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote A DNA Algorithm for Calculating the Maximum Flow of a Network
Sackmann Andrea, Brown Kristelle, Formanowicz Piotr, Morgan Kevin, Kalsheker Noor, Garibaldi Jon M., Blażewicz Jacek
Foundations of Computing and Decision Sciences
|
2023
|
Vol. 48, No. 4
483--506
EN
DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied. We aim to provide an approach to calculate the value of the maximum flow in networks by encoding the mathematical problem in DNA molecules and by using molecular biology techniques to manipulate the DNA. We present results which demonstrate that the algorithm works for an example network problem. This paper presents the first application of DNA computing to network-flow problems. The presented algorithm has a linear time complexity where the calculation itself is done in a constant number of steps.
2
Content available remote DNA Ion Detector and Logic Circulation Amplification Model Based on Mercury and Silver Ions
Guo Bingjie, Wang Luhui, Wu Tao, Dong Yafei
Fundamenta Informaticae
|
2019
|
Vol. 164, nr 2-3
195--205
EN
Here, two two-way ion detector (TWID) and one DNA cascade logic circuit and signal amplifier model had been created. Firstly, we have constructed two bidirectional mercury and silver ion detectors, both of which can be used to detect mercury and silver ions at the same time, that means a single molecule can detect two kinds of heavy metal ions at the same time. The unique design of the switches offers significant advantages over existing methods. In addition, the two bidirectional ion detectors enable the design of the logic gates (OR, AND) using Ag+ and Hg2+ as inputs. Secondly, we constructed a two-level “AND” logic gate by combining the above two logic gates. This logic model takes the output of “OR” logic gate as the input of the next logic gate, which not only realizes the logic operation, but also achieves the function of signal amplification. We are able to recognize the logic output signals effortlessly by observing the amount of fluorescence. It’s a simple, economic and safe approach for the design of a complex multiple-input DNA logic circulation amplification model. Finally, we proved the feasibility of our model by PAGE and fluorescence alteration.
3
Content available Wnioskowanie logiczne za pomocą DNA. Reguła kontrapozycji
Rogowski Łukasz
Studia i Materiały Informatyki Stosowanej
|
2013
|
nr 12
11--18
PL
Obliczenia DNA (z ang. DNA computing) to nowa dziedzina informatyki, będąca alternatywą dla tradycyjnych systemów komputerowych, polegająca na wykorzystaniu cząsteczek molekularnych do rozwiązywania problemów algorytmicznych, matematycznych i logicznych. Niniejszy artykuł przedstawia istniejące implementacje systemów wnioskowania realizowanych za pomocą DNA oraz nową koncepcję takiego systemu, uwzględniającą nowe elementy: negację i regułę kontrapozycji w implikacji.
EN
DNA computing is one of new computational paradigms which are alternative to traditional computer systems. Biological molecules in special laboratory conditions can be used to solve mathematical, logical and algorithmic purposes. This paper describes some already existing models of logical inference systems and the new proposal – DNA deduction system using new elements: negation and rule of contraposition.
4
Content available remote Arithmetical Analysis of Biomolecular Finite Automaton
Krasiński T., Sakowski S., Waldmajer J., Popławski T.
Fundamenta Informaticae
|
2013
|
Vol. 128, nr 4
463--474
EN
In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.
5
Content available remote Complexity Issues in Computational Biology
Blazewicz J., Kasprzak M.
Fundamenta Informaticae
|
2012
|
Vol. 118, nr 4
385-401
EN
The progress of research in the area of computational biology, visible in last decades, brought, among others, a new insight into the complexity issues. The latter, previously studied mainly on the ground of computer science or operational research, gained by a confrontation with problems from the new area. In the paper, several complexity issues inspired by computational biology are presented.
6
Inteligencja obliczeniowa, zastosowania biomedyczne i ontologiczne bazy wiedzy : Wilga 2012
Romaniuk R. S.
Elektronika : konstrukcje, technologie, zastosowania
|
2012
|
Vol. 53, nr 10
154-161
PL
Artykuł jest piatą częścią z kilku, dokonującą przeglądu prac Jubileuszowego XXX Sympozjum Wilga 2012 Fotonika i Inżynieria Internetu, dotyczacą zastosowań inteligencji obliczeniowej w kryptografii, biomedycynie, komputingu. Przedstawiono wybór prac prowadzonych przez młodych uczonych w różnych krajowych ośrodkach naukowych. Tematyka Sympozjum Wilga 2012 obejmowała nanomateriaty i nanotechnologie dla fotoniki, światłowody czujnikowe i nieliniowe, obiektowo zorientowane projektowanie sprzętu, metrologia fotoniczna, zastosowania optoelektroniki i fotoniki, łączne projektowanie fotoniki i elektroniki, systemy optoelektoniczne i fotoniczne dla astronomii, techniki kosmicznej i eksperymentów fizyki wysokich energii, systemy pomiarowe dla tokamaka JET, eksperyment Pi-of-the-sky, eksperymenty CMS i TOTEM. Sympozjum Wilga jest corocznym podsumowaniem rozwoju licznych prac doktorskich prowadzonych w tej tematyce w kraju. Sympozjum Wilga jest również okazją do spotkania studentów i doktorantów z kraju i z zagranicy zaangażowanych w dzialalność w SPIE, IEEE, OSA oraz PSP - Polskie Stowarzyszenie Fotoniczne.
EN
This paper is the fifth part (out of several) of the research survey of the Jubilee XXXth edition of WILGA Symposium on Photonics and Web Engineering, concerned with high performance computing and artificial intelligence in cryptography, biomedicine and DNA computing. It presents a digest of chosen technical work results shown by young researchers from different technical universities from this country during the Jubilee XXXth SPIE-IEEE Wilga 2012 symposium on Photonics and Web Engineering. Topical tracks of the symposium embraced, among others, nanomaterials and nanotechnologies for photonics, sensory and nonlinear optical fibers, object oriented design of hardware, photonic metrology, optoelectronics and photonics applications, photonics-electronics co-design, optoelectronic and electronic systems for astronomy and high energy physics experiments, JET tokamak and pi-of-the sky experiments development. The symposium is an annual summary in the development of numerable Ph.D. theses carried out in this country in the area of advanced electronic and photonic systems. It is also a great occasion for SPIE, IEEE, OSA and PSP students to meet together in a large group spanning the whole country with guests from this part of Europe.
7
Content available remote On the Regularity of Iterated Hairpin Completion of a Single Word
Kari L., Seki S., Kopecki S.
Fundamenta Informaticae
|
2011
|
Vol. 110, nr 1-4
201-215
EN
Hairpin completion is an abstract operation modeling a DNA bio-operation which receives as input a DNA strand w = xaya, and outputs w' = xayax, where x denotes the Watson- Crick complement of x. In this paper, we focus on the problem of finding conditions under which the iterated hairpin completion of a given word is regular. According to the numbers of words a and a that initiate hairpin completion and how they are scattered, we classify the set of all words w. For some basic classes of words w containing small numbers of occurrences of a and a, we prove that the iterated hairpin completion of w is regular. For other classes with higher numbers of occurrences of a and a, we prove a necessary and sufficient condition for the iterated hairpin completion of a word in these classes to be regular.
8
Przegląd modeli i praktycznych implementacji DNA obliczeń
Krasiński T., Sakowski S.
Studia Informatica
|
2008
|
Vol. 29, nr 4A
5-30
PL
W artykule omówiono różne możliwości przetwarzania informacji za pomocą łańcuchów DNA. Przedstawiono wyniki niektórych prac doświadczalnych oraz teoretyczne modele obliczeń za pomocą DNA.
EN
In this paper we discuss various possibilities of using DNA to information processing. We describe some practical implementations and theoretical models of computation built on DNA.
9
Content available remote Characterizing DNA Bond Shapes Using Trajectories
Domaratzki M.
Fundamenta Informaticae
|
2008
|
Vol. 87, nr 3-4
269-285
EN
We consider the use of DNA trajectories to characterize DNA bond shapes. This is an extension of recent work on the bond-free properties of a language. Using a new definition of bondfreeness, we show that we can increase the types of DNA bond shapes which are expressible. This is motivated by the types of bond shapes frequently found in DNA computing. We examine the algebraic properties of sets of DNA trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.
10
Content available remote Extended Shapiro finite state automaton built on DNA
Krasiński T., Sakowski S.
Foundations of Computing and Decision Sciences
|
2008
|
Vol. 33, No. 3
241-255
EN
The paper deals with cooperation problems in the case of several parties having different sets of criteria measuring their payoffs. It presents interactive procedures supporting multicriteria analysis and aiding consensus seeking through a mediation process. Using ideas of the cooperative game theory, a mathematical model describing cooperation situations and deriving possible payoffs of parties can be constructed. The model is a base for the analysis made. Solution concepts developed in the cooperative game theory are applied in the mediation process. The procedures can be used in a computer-based system supporting analysis carried on by the parties.
11
Content available remote Finite state automata built on DNA
Nowak K., Plucienniczak A.
Biocybernetics and Biomedical Engineering
|
2008
|
Vol. 28, no. 4
3-19
EN
This paper describes a non-deterministic finite-state automaton based on DNA strands. The automaton uses massive parallel processing offered by molecular approach for computation and exhibits a number of advantages over traditional electronic implementations. This device is used to analyze DNA molecules, whether they are described by specified regular expression. Presented ideas are confirmed by experiment performed in a genetic engineering laboratory.
12
Content available remote An Algebraic Characterization of Semi-Simple Splicing
Ceterchi R.
Fundamenta Informaticae
|
2006
|
Vol. 73, nr 1-2
19-25
EN
An algebraic characterization of simple splicing languages given in [6] is extended to semi-simple splicing languages
13
Content available remote A Formal Language Analysis of DNA Hairpin Structures
Kari L., Losseva E., Konstantindis S., Sosik P., Thierrin G.
Fundamenta Informaticae
|
2006
|
Vol. 71, nr 4
453-475
EN
The concept of hairpin structures in formal languages is motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form xvyq(v)z, with certain additional conditions, for an involution q (a function q with the property that q2 equals the identity function). A particular involution, the so-called Watson-Crick involution, can characterize binding of two DNA strands. We study algebraic and decision properties, finiteness and descriptional complexity of hairpin (-free) languages. We show an existence of polynomial-time algorithms deciding hairpin-freeness of regular and context-free sets. Two related DNA secondary structures are considered, taking into the account imperfect bonds (bulges, mismatches) and multiple hairpins. Finally, effective methods for design of long hairpin-free DNA words are given.
14
Content available remote On the Logic and Geometry of Bilinear Forms
Manca V.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
261-273
EN
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.
15
Content available remote Biosyntax : An Overview
Bel-Enguix G., Jiménez-López M. D.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
17-28
EN
In this paper we consider a new framework for linguistics based on the behavior of DNA molecules: biosyntax. This new framework includes two approaches - molecular syntax and recombination patterns - that seem to be quite suitable for explaining in a completely new way some syntactic phenomena. Molecular syntax and recombination patterns are two different formalisms with the same single idea: mechanisms at work in biology may be used in the field of linguistics and natural language processing and may provide a simpler and more efficient approach to the description of the syntax of natural languages.
16
Content available remote Membranes Versus DNA
Marcus S.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
223-227
EN
Based on some recent arguments brought into attention by some important authors, we point out the insufficiency of DNA in explaining life and the importance of membranes in bridging this gap. We also discuss the delicate, still open problem concerning the mathematical status of membrane.
17
Content available remote DNA and Membrane Algorithms for SAT
Manca V.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
205-221
EN
Some DNA algorithms proposed in the literature for propositional satisfiability (SAT) are analyzed. In the class of `extract model' the two sub-classes of `literal string' and `clause string' algorithms are compared and a new formulation of these algorithms is given in terms of membrane systems. Then, the duality between literal string and clause string formulation of SAT is expressed by means of `singleton matrices' that introduce another membrane algorithm for SAT. The analysis developed suggests the perspective of membrane systems as problem-solving agents based on molecule localization, transformation, and propagation.
18
Content available remote A Direct Construction of a Universal P System
Frisco P., Hoogeboom H.J., Sant P.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
103-122
EN
We present a direct universal P system based on splicing. Our approach differs from those shown in previous papers as the P system we construct takes as input an encoding of another P system. Previous results were based on the simulation of universal type-0 grammars or Turing machines. We think that the approach we use can be applied to other variants of P systems.
19
Przekraczanie granic mikroelektroniki
Wąsiewicz P., Mulawka J.
Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne
|
2001
|
R. 75, nr 1
8-15
PL
W artykule tym opisano nowe technologie mikro- i nanoelektroniki, m.in. zagadnienia elektroniki molekularnej i organicznej, DNA computing, nowe rodzaje dużej pojemności dysków twardych.
EN
In this paper new technologies in micro- and nanoelectronics such as molecular and organic electronics, DNA computing, massive storage means are described.
20
Content available remote DNA computing : a review
Deaton R., Garzon M., Rose J., Franceschetti D.R., Stevens S.E., Jr.
Fundamenta Informaticae
|
1998
|
Vol. 35, nr 1-4
231-245
EN
DNA computing holds out the promise of important and significant connections between computers and living systems, as well as promising massively parallel computations. Before these promises are fulfilled, however, important challenges related to errors and practicality have to be addressed. On the other hand, new directions toward a synthesis of molecular evolution and DNA computing might circumvent the problems that have hindered development, so far.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.