LNCS 4287 – DNA Computing 1st edition by Chengde Mao, Takashi Yokomori – Ebook PDF Instant Download/DeliveryISBN: 9783540684237
Full download LNCS 4287 – DNA Computing 1st edition after payment.
Product details:
ISBN-13 : 9783540496960
Author : Chengde Mao, Takashi Yokomori
One of the main research topics in DNA computing is associated with the design of information encoding single or double stranded DNA strands that are “suitable” for computation. Double stranded or partially double stranded DNA occurs as a result of binding between complementary DNA single strands (A is complementary to T and C is complementary to G). This paper continues the study of the algebraic properties of DNA word sets that ensure that certain undesirable bonds do not occur. We formalize and investigate such properties of sets of sequences, e.g., where no complement of a sequence is a prefix or suffix of another sequence or no complement of a concatenation of n sequences is a subword of the concatenation of n + 1 sequences. The sets of code words that satisfy the above properties are called θ – prefix, θ-suffix and θ-intercode respectively, where θ is the formalization of the Watson-Crick complementarity. Lastly we develop certain methods of constructing such sets of DNA words with good properties and compute their informational entropy
LNCS 4287 – DNA Computing 1st Table of contents:
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
Algorithms for Computing Variants of the Longest Common Subsequence Problem
Constructing Labeling Schemes Through Universal Matrices
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
Analyzing Disturbed Diffusion on Networks
Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
On Isomorphism and Canonization of Tournaments and Hypertournaments
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
Deterministic Random Walks on the Two-Dimensional Grid
Improving Time and Space Complexity for Compressed Pattern Matching
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
A Simple Message Passing Algorithm for Graph Partitioning Problems
Minimal Interval Completion Through Graph Exploration
Balanced Cut Approximation in Random Geometric Graphs
Improved Algorithms for the Minmax-Regret 1-Center Problem
On Approximating the Maximum Simple Sharing Problem
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
People also search for LNCS 4287 – DNA Computing 1st:
l-dna-c8200
ecn-2 processing lab
dna-encoded libraries
dna-encoded library technology
ecn-2 processing
You may also like…
