DNA Sequence Design Based on the Same Subsequences

Han Li; Fang Fang Ma

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

Paper Titles

An Improved Artificial Immune System Model
p.311

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

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 420DNA Sequence Design Based on the Same Subsequences

DNA Sequence Design Based on the Same Subsequences

Abstract:

The set of DNA subsequences of length was divided into classes by Watson-Crick Hamming distance which is not less than half of the length of the subsequences. These classes are suitable for encoding. They form a good code. Finally, accounting the size of the code which has been structured.

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:

339-342

DOI:

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

Citation:

Cite this paper

Online since:

September 2013

Authors:

Han Li, Fang Fang Ma

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] Ma Fangfang. The length design of the same largest subsequence Applied Mechanics and Materials, (2012).

Google Scholar

[2] 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

[3] Takahashi N, Kameda A, Yamamoto M. Preliminary Proceedings of tenth international meeting on DNA based computers. 2004 [C]. [S. l. ]: [s. n. ], 2004: 355-364.

Google Scholar