The genetic code, algebra of projection operators and problems of inherited biological ensembles

نویسنده

  • Sergey Petoukhov
چکیده

This article is devoted to applications of projection operators to simulate phenomenological properties of the molecular-genetic code system. Oblique projection operators are under consideration, which are connected with matrix representations of the genetic coding system in forms of the Rademacher and Hadamard matrices. Evidences are shown that sums of such projectors give abilities for adequate simulations of ensembles of inherited biological phenomena including ensembles of biological cycles, morphogenetic ensembles of phyllotaxis patterns, mirror-symmetric patterns, etc. For such modeling, the author proposes multidimensional vector spaces, whose subspaces are under a selective control (or coding) by means of a set of matrix operators on base of genetic projectors. Development of genetic biomechanics is discussed. The author proposes and describes special systems of multidimensional numbers under names “tensorcomplex numbers”, “tensorhyperbolic numbers”, etc. Described results can be used for developing algebraic biology, biotechnical applications and some other fields of science and technology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix genetics, part 4: cyclic changes of the genetic 8-dimensional Yin-Yang-algebras and the algebraic models of physiological cycles

The article continues an analysis of the genetic 8-dimensional Yin-Yang-algebra. This algebra was revealed in a course of matrix researches of structures of the genetic code and it was described in the author's articles arXiv:0803.3330 and arXiv:0805.4692. The article presents data about many kinds of cyclic permutations of elements of the genetic code in the genetic (8x8)matrix [C A; U G] of 6...

متن کامل

A Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

متن کامل

A Forward-Backward Projection Algorithm for Approximating of the Zero of the ‎S‎um of ‎T‎wo Operators

‎I‎n this paper‎, ‎a‎ forward-‎b‎ackward projection algorithm is considered for finding zero points of the sum of two operators‎ ‎in Hilbert spaces‎. ‎The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly‎ ‎monotone operator and a maximal monotone operator‎. ‎We apply the result for solving the variational inequality problem, fixed po...

متن کامل

m-Projections involving Minkowski inverse and range symmetric property in Minkowski space

In this paper we study the impact of Minkowski metric matrix on a projection in the Minkowski Space M along with their basic algebraic and geometric properties.The relation between the m-projections and the Minkowski inverse of a matrix A in the minkowski space M is derived. In the remaining portion commutativity of Minkowski inverse in Minkowski Space M is analyzed in terms of m-projections as...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013