The Length Design of the Same Largest Subsequence

Fang Fang Ma; Han Li

doi:10.4028/www.scientific.net/AMM.420.343

Paper Titles

Contribution to Multiaxial Damage Calculation Using FEM
p.318

A Framework for Object-Oriented Data Mining Based on Higher-Order Logic Programming
p.325

Design and Implementation of the 3-D Simulation Model for TPS Power Supply Cable Engineering
p.333

DNA Sequence Design Based on the Same Subsequences
p.339

The Length Design of the Same Largest Subsequence
p.343

Bi-Directional Evolutionary Structural Optimization Method with Draw Direction Constraints
p.346

Research on Modeling and Control Strategy of Parallel Hybrid Electric Back-Loading Compression Sanitation Vehicle
p.355

Analysis on Model Nonlinearity for Control System of Heat Supply Unit
p.363

Model of an Rotating Valve Based Electro-Hydraulic Servomechanism and its Dead-Zone Compensation Control
p.369

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 420The Length Design of the Same Largest Subsequence

The Length Design of the Same Largest Subsequence

Abstract:

DNA sequence design which is also called DNA encoding is a basic problem in DNA computation. The strands involved in the experiments should not exhibit any undesired behavior, especially they should not form false positive. So they could ensure the efficiency and veracity of the experiments. The properties of subsequences can reflect those of the whole DNA sequences. The definitions of the same subsequence and the same largest subsequence are proposed in this paper. And the relationship between them can be got. By analyzing properties of the same largest subsequence, the length can be achieved.

You might also be interested in these eBooks

Recent Trends in Materials and Mechanical Engineering II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 420)

Pages:

343-345

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.420.343

Citation:

Cite this paper

Online since:

September 2013

Authors:

Fang Fang Ma, Han Li

Keywords:

Class, DNA Computation, DNA Sequence, Same Largest Subsequence

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Adleman. Molecular computation of solution to combinatorial problems [J]. Science, 1994, 266 (11): 1021-1024.

Google Scholar

[2] R.J. Lipton. DNA solution of hard computational problems [J]. Science, 1995, 268: 542-545.

DOI: 10.1126/science.7725098

Google Scholar

[3] J. Berstel, L. Boasson. Partial words and a theorem of fine and wilf [J]. Theoretical Computer Science. 1999, 218: 135-141.

DOI: 10.1016/s0304-3975(98)00255-2

Google Scholar

[4] C. Dan, Tulpan, H. Holger, Hoos, E. Anne. Condon. Stochastic local search algorithms for DNA word design 2003[C]. LNCS 2568, [S. l. ]: [s. n. ], 2003, 229-241.

DOI: 10.1007/3-540-36440-4_20

Google Scholar

[5] A. G. Frutos, et al. Demonstration of a word design strategy for DNA computing on surface [J]. Nucleic Acids Research, 1997, 25(23): 4748-4757.

DOI: 10.1093/nar/25.23.4748

Google Scholar

[6] Masanori Arita, Satoshi Kobayashi. DNA sequence design using templates [J]. New Generation Computing, 2002, 20: 263-277.

DOI: 10.1007/bf03037360

Google Scholar

[7] Wenbin Liu, Shudong Wang, Lin Gao, Fengyeu Zhang, Jin Xu. DNA sequence design based on template strategy [J]. J. Chem. Inf. Computer. Science. 2003, 43: 2014-(2018).

DOI: 10.1021/ci025645s

Google Scholar

[8] E. B. Baum. DNA sequences useful for computation. Proceedings of the second Annual Meeting DNA-Based computers 1996[C]. [S. l. ]: [s. n. ], (1996).

Google Scholar