نتایج جستجو برای: dna algorithm

تعداد نتایج: 1250590  

2013
Kang Zhou Jin Chen

Sticker model is imitated by using set, variable length vector and biochemistry operator instead of tube, memory strand and biochemistry experiment for the first time. Batch separation operator and electrophoresis operator are first put forward based on DNA algorithm of Set Covering Problem (SCP) based on sticker model. Expression way, calculation method and basic properties of variable length ...

Journal: :CoRR 2011
D. Prabhu M. Adimoolam

The vast parallelism, exceptional energy efficiency and extraordinary information inherent in DNA molecules are being explored for computing, data storage and cryptography. DNA cryptography is a emerging field of cryptography. In this paper a novel encryption algorithm is devised based on number conversion, DNA digital coding, PCR amplification, which can effectively prevent attack. Data treatm...

2007
Umesh Ghoshdastider Banani Saha

The genome of an organism contains all hereditary information encoded in DNA. So it is extremely important to sequence the genome which determines how the organisms survive, develop and multiply. Since three decades, due to massive efforts on DNA sequencing, complete genome sequence of a large number of organisms including humans are now known and the genomic databases are growing exponentially...

2001
Vincenzo Manca Claudio Zandron

A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton’s extraction model, where the number of separations equates the number of literals of the instance.

2008
Jiang Lu

Ordered Indexed Seed Algorithm is a new published DNA pair-wise comparison algorithm, which can improve the DNA alignment performance dramatically. Its design structure also has potential ability to implement in parallel. This project implements the algorithm and imports it into MPI platform to simulate a prototype of gene database. This report also suggests some methods to implement this algor...

Journal: : 2023

Recently, the growth of data transmission through various networks has necessity for an elevated level security. Encryption is one essential technologies protecting and ensuring integrity IoT devices. Secure communication among constrained devices critical during from client to server Lightweight cipher algorithms are defined as a secure solution with limited computational functions memory. On ...

Journal: :Journal of computational chemistry 2016
Steven C. Howell Xiangyun Qiu Joseph E. Curtis

Understanding the structure-function relationship of biomolecules containing DNA has motivated experiments aimed at determining molecular structure using methods such as small-angle X-ray and neutron scattering (SAXS and SANS). SAXS and SANS are useful for determining macromolecular shape in solution, a process which benefits by using atomistic models that reproduce the scattering data. The var...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تحصیلات تکمیلی علوم پایه زنجان - دانشکده ریاضی 1393

in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...

Journal: :Proceedings. IEEE Computer Society Bioinformatics Conference 2003
Shoudan Liang

The cWINNOWER algorithm detects fuzzy motifs in DNA sequences rich in protein-binding signals. A signal is defined as any short nucleotide pattern having up to d mutations differing from a motif of length l. The algorithm finds such motifs if multiple mutated copies of the motif (i.e., the signals) are present in the DNA sequence in sufficient abundance. The cWINNOWER algorithm substantially im...

2004
M. KASPRZAK

In the paper, the problem of isothermic DNA sequencing by hybridization, without any errors in its input data, is presented and an exact polynomial-time algorithm solving the problem is described. The correctness of the algorithm is confirmed by an enumerative proof.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید