The project is aimed to work out the interactive software for nucleotide sequence visualization. Methods. The program named as “Triander” was created under Free Pascal RAD IDE Lazarus. The source code and compiled for Windows binaries are freely accessible at http://icbge.org.ua/ukr/Triander. This program can produce four types of plots. It is possible to build three DNA walks done independently for each nucleotide position in triplets. The usage of not equal in modulus nucleotide vectors lead to significant reduction of visual information loss in DNA walks. The program can be used in the investigation of fine structure of sequences and find in them standard patterns and nontrivial regions for further detail analysis.
The Triander program is an interactive software package for nucleotide sequence visualization. The program was developed using the freeware Pascal RAD IDE Lazarus, and its source code and binaries compiled for Windows are freely accessible at http://www.icbge.org.ua/eng/Triander . Triander can produce four types of plots. It is possible to build three DNA walks independently for each nucleotide position in triplets. The use of nucleotide vectors with unequal modulus leads to a significant reduction in the visual information lost in DNA walks. The program can be used in the investigation of the fine structure of sequences, to find standard patterns in them and to locate nontrivial regions for further detailed analysis.
Основные задачи и методы нанобиотехнологии (Университетские субботы - 01.03.14)MSPU
Основные задачи и методы нанобиотехнологии
Профессор Кафедры биоорганической химии и биотехнологии Кутузова Н.М.
Биолого-химический факультет МПГУ 2014
The Triander program is an interactive software package for nucleotide sequence visualization. The program was developed using the freeware Pascal RAD IDE Lazarus, and its source code and binaries compiled for Windows are freely accessible at http://www.icbge.org.ua/eng/Triander . Triander can produce four types of plots. It is possible to build three DNA walks independently for each nucleotide position in triplets. The use of nucleotide vectors with unequal modulus leads to a significant reduction in the visual information lost in DNA walks. The program can be used in the investigation of the fine structure of sequences, to find standard patterns in them and to locate nontrivial regions for further detailed analysis.
Основные задачи и методы нанобиотехнологии (Университетские субботы - 01.03.14)MSPU
Основные задачи и методы нанобиотехнологии
Профессор Кафедры биоорганической химии и биотехнологии Кутузова Н.М.
Биолого-химический факультет МПГУ 2014
ОТОЖДЕСТВЛЕНИЕ БИОЛОГИЧЕСКИХ ТКАНЕЙ С ПОМОЩЬЮ ТЕЛЕКОММУНИКАЦИОННЫХ МИКРОСИСТЕМITMO University
В статье рассматриваются телекоммуникационные способы и устройства, основанные на функциональных узлах микроскопов, для верификации (отождествления) расположения конца медицинской иглы в биологических тканях в процессе проведения медицинских операций.
ОТОЖДЕСТВЛЕНИЕ БИОЛОГИЧЕСКИХ ТКАНЕЙ С ПОМОЩЬЮ ТЕЛЕКОММУНИКАЦИОННЫХ МИКРОСИСТЕМITMO University
В статье рассматриваются телекоммуникационные способы и устройства, основанные на функциональных узлах микроскопов, для верификации (отождествления) расположения конца медицинской иглы в биологических тканях в процессе проведения медицинских операций.
Хромосомы представляют собой нуклеопротеидные структуры, которые находятся в ядре эукариотической клетки, содержащей ядро. Хромосомы наиболее заметны в таких фазах клеточного цикла, как митоз и мейоз. Далее в статье будет приведено описание этих структур. Выясним также, сколько пар хромосом у человека.
We introduce a polyadic analog of supersymmetry by considering the polyadization procedure (proposed by the author) applied to the toy model of one-dimensional supersymmetric quantum mechanics. The supercharges are generalized to polyadic ones using the n-ary sigma matrices defined in earlier work. In this way, polyadic analogs of supercharges and Hamiltonians take the cyclic shift block matrix form, and they can describe multidegenerated quantum states in a way that is different from the N-extended and multigraded SQM. While constructing the corresponding supersymmetry as an n-ary Lie superalgebra (n is the arity of the initial associative multiplication), we have found new brackets with a reduced arity of 2<=m<n and a related series of m-ary superalgebras (which is impossible for binary superalgebras). In the case of even reduced arity m we obtain a tower of higher order (as differential operators) even Hamiltonians, while for m odd we get a tower of higher order odd supercharges, and the corresponding algebra consists of the odd sector only.
https://arxiv.org/abs/2406.02188
We generalize σ-matrices to higher arities using the polyadization procedure proposed by the author. We build the nonderived n-ary version of SU(2) using cyclic shift block matrices. We define a new function, the polyadic trace, which has an additivity property analogous to the ordinary trace for block diagonal matrices and which can be used to build the corresponding invariants. The elementary Σ-matrices introduced here play a role similar to ordinary matrix units, and their sums are full Σ-matrices which can be treated as a polyadic analog of σ-matrices. The presentation of n-ary SU(2) in terms of full Σ-matrices is done using the Hadamard product. We then generalize the Pauli group in two ways: for the binary case we introduce the extended phase shifted σ-matrices with multipliers in cyclic groups of order 4q (q>4), and for the polyadic case we construct the correspondent finite n-ary semigroup of phase-shifted elementary Σ-matrices of order 4q(n-1)+1, and the finite n-ary group of phase-shifted full Σ-matrices of order 4q. Finally, we introduce the finite n-ary group of heterogeneous full Σ^het-matrices of order (4q(n-1))^4. Some examples of the lowest arities are presented.
https://arxiv.org/abs/2403.19361. *) https://www.researchgate.net/publication/360882654_Polyadic_Algebraic_Structures, https://iopscience.iop.org/book/978-0-7503-2648-3.
CONTENTS 1. INTRODUCTION 2. PRELIMINARIES 3. POLYADIC SU p2q 4. POLYADIC ANALOG OF SIGMA MATRICES 4.1. Elementary Σ-matrices 4.2. Full Σ-matrices 5. TERNARY SUp2q AND Σ-MATRICES 6. n-ARY SEMIGROUPS AND GROUPS OF Σ-MATRICES 6.1. The Pauli group 6.2. Groups of phase-shifted sigma matrices 6.3. The n-ary semigroup of elementary Σ-matrices 6.4. The n-ary group of full Σ-matrices 7. HETEROGENEOUS FULL Σ-MATRICES REFERENCES
We introduce a new class of division algebras, the hyperpolyadic algebras, which correspond to the binary division algebras R, C, H, O without considering new elements. First, we use the matrix polyadization procedure proposed earlier which increases the dimension of the algebra. The algebras obtained in this way obey binary addition and a nonderived n-ary multiplication and their subalgebras are division n-ary algebras. For each invertible element we define a new norm which is polyadically multiplicative, and the corresponding map is a n-ary homomorphism. We define a polyadic analog of the Cayley-Dickson construction which corresponds to the consequent embedding of monomial matrices from the polyadization procedure. We then obtain another series of n-ary algebras corresponding to the binary division algebras which have a higher dimension, that is proportional to the intermediate arities. Second, a new polyadic product of vectors in any vector space is defined. Endowed with this product the vector space becomes a polyadic algebra which is a division algebra under some invertibility conditions, and its structure constants are computed. Third, we propose a new iterative process ("imaginary tower"), which leads to nonunital nonderived ternary division algebras of half the dimension, which we call "half-quaternions" and "half-octonions". The latter are not subalgebras of the binary division algebras, but subsets only, since they have different arity. Nevertheless, they are actually ternary division algebras, because they allow division, and their nonzero elements are invertible. From the multiplicativity of the introduced "half-quaternion" norm we obtain the ternary analog of the sum of two squares identity. We prove that the unitless ternary division algebra of imaginary "half-octonions" we have introduced is ternary alternative.
https://arxiv.org/abs/2312.01366
https://www.amazon.com/s?k=duplij
https://arxiv.org/abs/2312.01366.
We introduce a new class of division algebras, hyperpolyadic algebras, which correspond to the binary division algebras R, C, H, O without considering new elements. First, we use the proposed earlier matrix polyadization procedure which increases the algebra dimension. The obtained algebras obey the binary addition and nonderived n-ary multiplication and their subalgebras are division n-ary algebras. For each invertible element we define a new norm which is polyadically multiplicative and the corresponding map is n-ary homomorphism. We define a polyadic analog of the Cayley-Dickson construction which corresponds to the consequent embedding of monomial matrices from the polyadization procedure. Then we obtain another series of n-ary algebras corresponding to the binary division algebras which have more dimension, that is proportional to intermediate arities, and they are not isomorphic to those obtained by the previous constructions. Second, we propose a new iterative process (we call it "imaginary tower"), which leads to nonunital nonderived ternary division algebras of half dimension, we call them "half-quaternions" and "half-octonions". The latter are not subalgebras of the binary division algebras, but subsets only, since they have different arity. Nevertheless, they are actually ternary division algebras, because allow division, and their nonzero elements are invertible. From the multiplicativity of the introduced "half-quaternion" norm we obtain the ternary analog of the sum of two squares identity. We prove that the introduced unitless ternary division algebra of imaginary "half-octonions" is ternary alternative.
178 pages, 6 Chapters. DOI: 10.1088/978-0-7503-5281-9. This book presents new and prospective approaches to quantum computing. It introduces the many possibilities to further develop the mathematical methods of quantum computation and its applications to future functioning and operational quantum computers. In this book, various extensions of the qubit concept, starting from obscure qubits, superqubits and other fundamental generalizations, are considered. New gates, known as higher braiding gates, are introduced. These new gates are implemented as an additional stage of computation for topological quantum computations and unconventional computing when computational complexity is affected by its environment. Other generalizations are considered and explained in a widely accessible and easy-to-understand way. Presented in a book for the first time, these new mathematical methods will increase the efficiency and speed of quantum computing.Part of IOP Series in Coherent Sources, Quantum Fundamentals, and Applications. Key features • Provides new mathematical methods for quantum computing. • Presents material in a widely accessible way. • Contains methods for unconventional computing where there is computational complexity. • Provides methods to increase speed and efficiency. For the light paperback version use MyPrint service here: https://iopscience.iop.org/book/mono/978-0-7503-5281-9, also PDF, ePub and Kindle. For the libraries and direct ordering from IOP: https://store.ioppublishing.org/page/detail/Innovative-Quantum-Computing/?K=9780750352796. Amazon ordering: https://www.amazon.de/gp/product/0750352795
Quantum field theory has achieved some extraordinary successes over the past sixty years; however, it retains a set of challenging problems. It is not yet able to describe gravity in a mathematically consistent manner. CP violation remains unexplained. Grand unified theories have been eliminated by experiment, and a viable unification model has yet to replace them. Even the highly successful quantum chromodynamics, despite significant computational achievements, struggles to provide theoretical insight into the low-energy regime of quark physics, where the nature and structure of hadrons are determined. The only proposal for resolving the fine-tuning problem, low-energy supersymmetry, has been eliminated by results from the LHC. Since mathematics is the true and proper language for quantitative physical models, we expect new mathematical constructions to provide insight into physical phenomena and fresh approaches for building physical theories.
https://www.mdpi.com/books/book/6455
We investigate finite field extensions of the unital 3-field, consisting of the unit element alone, and find considerable differences to classical field theory. Furthermore, the structure of their automorphism groups is clarified and the respective subfields are determined. In an attempt to better understand the structure of 3-fields that show up here we look at ways in which new unital 3-fields can be obtained from known ones in terms of product structures, one of them the Cartesian product which has no analogue for binary fields.
https://arxiv.org/abs/2212.08606
Abstract: Algebraic structures in which the property of commutativity is substituted by the me- diality property are introduced. We consider (associative) graded algebras and instead of almost commutativity (generalized commutativity or e-commutativity), we introduce almost mediality (“commutativity-to-mediality” ansatz). Higher graded twisted products and “deforming” brackets (being the medial analog of Lie brackets) are defined. Toyoda’s theorem which connects (universal) medial algebras with abelian algebras is proven for the almost medial graded algebras introduced here. In a similar way we generalize tensor categories and braided tensor categories. A polyadic (non-strict) tensor category has an n-ary tensor product as an additional multiplication with (n-1) associators of the arity (2n-1) satisfying a (n^2-1)-gon relation, which is a polyadic analog of the pentagon axiom. Polyadic monoidal categories may contain several unit objects, and it is also possible that all objects are units. A new kind of polyadic categories (called groupal) is defined: they are close to monoidal categories but may not contain units: instead the querfunctor and (natural) functorial isomorphisms, the quertors, are considered (by analogy with the querelements in n-ary groups). The arity-nonreducible n-ary braiding is introduced and the equation for it is derived, which for n=2 coincides with the Yang–Baxter equation. Then, analogously to the first part of the paper, we introduce “medialing” instead of braiding and construct “medialed” polyadic tensor categories.
In this note we, first, recall that the sets of all representatives of some special ordinary residue classes become (m, n)-rings. Second, we introduce a possible p-adic analog of the residue class modulo a p-adic integer. Then, we find the relations which determine, when the representatives form a (m, n)-ring. At the very short spacetime scales such rings could lead to new symmetries of modern particle models.
Книга «Поэфизика души» представляет собой полное, на момент издания 2022 г., собрание прозаических произведений автора. Как рассказы, так и миниатюры на полстраницы, пронизаны эмоциями и искренними чувствами на грани срыва, что заставляет возвращаться к ним вновь. Буквально каждое слово рисует уникальные картины нетривиальных внутренних миров автора, которые перетекают друг в друга поэтическими образами, воплощенными в прозе. Также включены юмористические путевые заметки о поездке в Китай.
Книга "Поэфизика души", Степан Дуплий – полное собрание прозы 2022, 230 стр. вышла в Ridero: https://ridero.ru/books/poefizika_dushi и Kindle Edition file на Амазоне: https://amazon.com/dp/B0B9Y4X4VJ . "Бумажную" книгу можно заказать на Озоне https://ozon.ru/product/poefizika-dushi-682515885/?sh=XPu-9Sb42Q и на ЛитРес: https://litres.ru/stepan-dupliy/poefizika-dushi-emocionalnaya-proza-kitayskiy-shtrih-punktir . Google books: https://books.google.com/books?id=9w2DEAAAQBAJ .
Книгу можно заказать из-за рубежа на AliExpress: https://aliexpress.com/item/1005004660613179.html .
Книга «Гравитация страсти» представляет собой полное собрание стихотворений автора на момент издания (август, 2022). Стихотворения пронизаны эмоциями и искренними чувствами на грани срыва, что заставляет возвращаться к ним вновь. Буквально каждое слово рисует уникальные картины нетривиальных внутренних миров автора, которые перетекают друг в друга необычными поэтическими образами.
Книга "Гравитация страсти", Степан Дуплий - полное собрание стихотворений 2022, 338 стр. вышла в Ridero: https://ridero.ru/books/gravitaciya_strasti
. Книга в мягкой обложке доступна для заказа на Ozon.ru: https://ozon.ru/product/gravitatsiya-strasti-707068219/?oos_search=false&sh=XPu-9TbW9Q
, на Litres.ru: https://www.litres.ru/stepan-dupliy/gravitaciya-strasti-stihotvoreniya , за рубежом на AliExpress: https://aliexpress.com/item/1005004722134442.html , и в электронном виде Kindle file на Amazon.com: https://amazon.com/dp/B0BDFTT33W .
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented as block diagonal matrices (resulting in the Wedderburn decomposition), general forms of polyadic structures are given by block-shift matrices. We combine these forms to get a general shape of semisimple nonderived polyadic structures (“double” decomposition of two kinds). We then introduce the polyadization concept (a “polyadic constructor”), according to which one can construct a nonderived polyadic algebraic structure of any arity from a given binary structure. The polyadization of supersymmetric structures is also discussed. The “deformation” by shifts of operations on the direct power of binary structures is defined and used to obtain a nonderived polyadic multiplication. Illustrative concrete examples for the new constructions are given.
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in the block-diagonal matrix form (Wedderburn decomposition), a general form of polyadic structures is given by block-shift matrices. We combine these forms in a special way to get a general shape of semisimple nonderived polyadic structures. We then introduce the polyadization concept (a "polyadic constructor") according to which one can construct a nonderived polyadic algebraic structure of any arity from a given binary structure. The polyadization of supersymmetric structures is also discussed. The "deformation" by shifts of operations on the direct power of binary structures is defined and used to obtain a nonderived polyadic multiplication. Illustrative concrete examples for the new constructions are given.
We generalize the Grothendieck construction of the completion group for a monoid (being the starting point of the algebraic $K$-theory) to the polyadic case, when an initial semigroup is $m$-ary and the corresponding final class group $K_{0}$ can be $n$-ary. As opposed to the binary case: 1) there can be different polyadic direct products which can be built from one polyadic semigroup; 2) the final arity $n$ of the class groups can be different from the arity $m$ of initial semigroup; 3) commutative initial $m$-ary semigroups can lead to noncommutative class $n$-ary groups; 4) the identity is not necessary for initial $m$-ary semigroup to obtain the class $n$-ary group, which in its turn can contain no identity at all. The presented numerical examples show that the properties of the polyadic completion groups are considerably nontrivial and have more complicated structure than in the binary case.
In book: S. Duplij, "Polyadic Algebraic Structures", 2022, IOP Publishing (Bristol), Section 1.5. See https://iopscience.iop.org/book/978-0-7503-2648-3
https://arxiv.org/abs/2206.14840
The book is devoted to the thorough study of polyadic (higher arity) algebraic structures, which has a long history, starting from 19th century. The main idea was to take a single set, closed under one binary operation, and to 'generalize' it by increasing the arity of the operation, called a polyadic operation. Until now, a general approach to polyadic concrete many-set algebraic structures was absent. We propose to investigate algebraic structures in the 'concrete way' and provide consequent 'polyadization' of each operation, starting from group-like structures and finishing with the Hopf algebra structures. Polyadic analogs of homomorphisms which change arity, heteromorphisms, are introduced and applied for constructing unusual representations, multiactions, matrix representations and polyadic analogs of direct product. We provide the polyadic generalization of the Yang–Baxter equation, find its constant solutions, and introduce polyadic tensor categories.
Suitable for university students of advanced level algebra courses and mathematical physics courses.
Key features
• Provides a general, unified approach
• Widens readers perspective of the possibilities to develop standard algebraic structures
• Provides the new kind of homomorphisms changing the arity, heteromorphisms, are introduced and applied for construction of new representations, multiactions and matrix representations
• Presents applications of 'polyadization' approach to concrete algebraic structures
We propose a generalization of the external direct product concept to polyadic algebraic structures which introduces novel properties in two ways: the arity of the product can differ from that of the constituents, and the elements from different multipliers can be “entangled” such that the product is no longer componentwise. The main property which we want to preserve is associativity, which is gained by using the associativity quiver technique, which was provided previously. For polyadic semigroups and groups we introduce two external products: (1) the iterated direct product, which is componentwise but can have an arity that is different from the multipliers and (2) the hetero product (power), which is noncomponentwise and constructed by analogy with the heteromorphism concept introduced earlier. We show in which cases the product of polyadic groups can itself be a polyadic group. In the same way, the external product of polyadic rings and fields is generalized. The most exotic case is the external product of polyadic fields, which can be a polyadic field (as opposed to the binary fields), in which all multipliers are zeroless fields. Many illustrative concrete examples are presented. Thу proposed construction can lead to a new category of polyadic fields.
https://arxiv.org/abs/2201.08479
We propose a generalization of the external direct product concept to polyadic algebraic structures which introduces novel properties in two ways: the arity of the product can differ from that of the constituents, and the elements from different multipliers can be "entangled" such that the product is no longer componentwise. The main property which we want to preserve is associativity, which is gained by using the associativity quiver technique provided earlier. For polyadic semigroups and groups we introduce two external products: 1) the iterated direct product which is componentwise, but can have arity different from the multipliers; 2) the hetero product (power) which is noncomponentwise and constructed by analogy with the heteromorphism concept introduced earlier. It is shown in which cases the product of polyadic groups can itself be a polyadic group. In the same way the external product of polyadic rings and fields is generalized. The most exotic case is the external product of polyadic fields, which can be a polyadic field (as opposed to the binary fields), when all multipliers are zeroless fields, which can lead to a new category of polyadic fields. Many illustrative concrete examples are presented.
A general mechanism for "breaking" commutativity in algebras is proposed: if the underlying set is taken to be not a crisp set, but rather an obscure/ fuzzy set, the membership function, reflecting the degree of truth that an element belongs to the set, can be incorporated into the commutation relations. The special "deformations" of commutativity and ?-commutativity are introduced in such a way that equal degrees of truth result in the "nondeformed" case. We also sketch how to "deform" ?-Lie algebras and Weyl algebras. Further, the above constructions are extended to n-ary algebras for which the projective representations and ?-commutativity are studied.
We generalize the regularity concept for semigroups in two ways simultaneously: to higher regularity and to higher arity. We show that the one-relational and multi-relational formulations of higher regularity do not coincide, and each element has several inverses. The higher idempotents are introduced, and their commutation leads to unique inverses in the multi-relational formulation, and then further to the higher inverse semigroups. For polyadic semigroups we introduce several types of higher regularity which satisfy the arity invariance principle as introduced: the expressions should not depend of the numerical arity values, which allows us to provide natural and correct binary limits. In the first definition no idempotents can be defined, analogously to the binary semigroups, and therefore the uniqueness of inverses can be governed by shifts. In the second definition called sandwich higher regularity, we are able to introduce the higher polyadic idempotents, but their commutation does not provide uniqueness of inverses, because of the middle terms in the higher polyadic regularity conditions. Finally, we introduce the sandwich higher polyadic regularity with generalized idempotents.
In this note we generalize the regularity concept for semigroups in two ways simul- taneously: to higher regularity and to higher arity. We show that the one-relational and multi-relational formulations of higher regularity do not coincide, and each element has several inverses. The higher idempotents are introduced, and their commutation leads to unique inverses in the multi-relational formulation, and then further to the higher inverse semigroups. For polyadic semigroups we introduce several types of higher regularity which satisfy the arity invariance principle as introduced: the expressions should not depend of the numerical arity values, which allows us to provide natural and correct binary limits. In the first definition no idempotents can be defined, analogously to the binary semigroups, and therefore the uniqueness of inverses can be governed by shifts. In the second definition called sandwich higher regularity, we are able to introduce the higher polyadic idempotents, but their commutation does not provide uniqueness of inverses, because of the middle terms in the higher polyadic regularity conditions.
Steven Duplij, "Higher regularity, inverse and polyadic semigroups", Preprint...
V. Duplij, S. Duplij. Triander - A new program for the visual analysis of the nucleotide sequence
1. Національна академія наук України
Інститут молекулярної біології і генетики
Українське товариство генетиків і селекціонерів
ім. М.І. Вавилова
ФАКТОРИ ЕКСПЕРИМЕНТАЛЬНОЇ
ЕВОЛЮЦІЇ ОРГАНІЗМІВ
ФАКТОРЫ ЭКСПЕРИМЕНТАЛЬНОЙ
ЭВОЛЮЦИИ ОРГАНИЗМОВ
FACTORS IN EXPERIMENTAL
EVOLUTION OF ORGANISMS
Збірник наукових праць
Видається з 2003 р.
ТОМ 17
Присвячено
110-річчю від дня народження Ервіна Чаргаффа
і 75-річчю від дня народження
академіка НААН України Ю.М. Сиволапа
Київ – 2015
2. УДК 575.8+631.52+60](082)
ББК 28.04я43+45.3я43+41.3я43+42-3я43
Ф 18
Р Е Д А К Ц І Й Н А К О Л Е Г І Я
Головний редактор В.А. Кунах
Заступник головного редактора Н.М. Дробик
І.В. Азізов (Азербайджан)
А. Атанасов (Болгарія)
Я.Б. Блюм
Р.А. Волков
Т.К. Горова
Н.Г. Горовенко
Д.М. Гродзинський
В.А. Драгавцев (Росія)
О.В. Дубровна
Г.В. Єльська
І.С. Карпова
А. В. Кільчевський (Білорусь)
І.А. Козерецька
В.А. Кордюм
М.В. Кучук
Л.Л. Лукаш
С.С. Малюта
В.Г. Михайлов
В.В. Моргун
М.А. Пілінська
В.Г. Радченко
С.Ю. Рубан
А.А. Сибірний
В.А. Сідоров (Україна–США)
О.О. Созінов
Т.К. Терновська
О.М. Тищенко
Г.Федак (Канада)
Відповідальний секретар – М.З. Мосула
Адреса редакції:
Інститут молекулярної біології і генетики НАНУ, вул. Академіка Заболотного, 150, Київ 03680
e-mail: kunakh@imbg.org.ua http://www.utgis.org.ua
Editorial board
Editor-in-Chief V.A Kunakh
Deputy editor N.M. Drobyk
I. V. Azizov (Azerbaijan)
A. Atanasov (Bulgaria)
Ya.B. Blum
R.A. Volkov
T.K. Gorova
N.G. Gorovenko
D.М. Grodzynskyy
V. A. Dragavtsev (Russia)
O.V. Dubrovna
A.V. El’ska
I.S. Karpova
A. V. Kilchevsky (Belarus)
I.A. Kozeretska
V.A. Kordium
N.V. Kuchuk
L.L. Lukash
S.S. Maliuta
V.G. Mykhailov
V.V. Morgun
M.A. Pilinska
V.G. Radchenko
S.Yu. Ruban
A.A. Sybirniy
V.A. Sidorov (Ukraine–USA)
O.O. Sozinov
T.K. Ternovska
O.M. Tyshcenko
G. Fedak (Canada)
Responsible secretary – M.Z. Mosula
Editorial office addres:
Institute of Molecular Biology and Genetics NAS of Ukraine, 150, Akademika Zabolotnogo str., Kyiv, 03680
e-mail: kunakh@imbg.org.ua http://www.utgis.org.ua
Затверджено до друку рішенням вченої ради Інституту молекулярної біології
і генетики НАН України (протокол № 9 від 9 червня 2015 р.)
Свідоцтво про державну реєстрацію друкованого засобу масової інформації
серія КВ № 20936-10736ПP від 29.08.2014
Ф 18
Фактори експериментальної еволюції організмів: зб. наук. пр. / Національна акаде-
мія наук України, Інститут молекулярної біології і генетики, Укр. т-во генетиків і селекціо-
нерів ім. М.І. Вавилова; редкол. / В.А. Кунах (голов. ред.) [та ін.]. – К.: Укр. т-во генетиків і
селекціонерів ім. М.І. Вавилова, 2015. – Т. 17. – 340 с. – ISSN 2219-3782
УДК 575.8+631.52+60](082)
ББК 28.04я43+45.3я43+41.3я43+42-3я43
ã Українське товариство генетиків
і селекціонерів ім. М.І. Вавилова, 2015
4. 52 ISSN 2219-3782. Фактори експериментальної еволюції організмів. 2015. Том 17
Дуплий В.П., Дуплий С.А.
Среди возможных комбинаций направлений
нуклеотидних векторов, т.е. векторов, которые
представляют тот или иной нуклеотид на диа-
грамме, нами была выбрана такая: С – Север, G –
Юг, T – Восток, A – Запад (рис. 2). Так как сте-
пень детерминации, а значит и длина нуклеотид-
ного вектора составляет для С – 4, для G – 3, для
T – 2, для A – 1, то диаграмма обхода последо-
вательности случайно выбранных нуклеотидов в
нашем случае распространяется в северо-восточ-
ном направлении. Это направление, как и четыре
основных, указывается на диаграмме.
Обычно диаграммы обхода ДНК строят-
ся однопиксельными ква-
дратами, поэтому поми-
мо потерь информации из-
за прохождения кривой по
одним и тем же координа-
там добавляются потери от
слияния лежащих рядом
участков кривой. Пробле-
ма становится острее при
переходе от анализа гено-
мов и хромосом к анализу
отдельных генов и регуля-
торных последовательно-
стей. Мы реализовали во-
зможность задавать длину
единичного вектора боль-
Рис. 1. Диаграммы обхода ДНК последовательности гена нитрат редуктазы Nia1;2 Physcomitrella patens (Ген-
банк AB232049): а – полная последовательность; б–г – фрагмент AB232049:2601-26300. Для построения ис-
пользовались нуклеотидные векторы равной длины (а, б) и пропорциональные степени детерминации нуклео-
тида (в, г). Длина единичного вектора: а–в – равна ширине нуклеотидной кривой, г – больше ширины кривой
В системе визуализации, где нуклеотиды
передаются векторами различными не только по
направлению, но и по длине [8], в значительной
мере эта проблема снимается (рис. 1 в, г). Ме-
тод основывается на использовании в качестве
длины нуклеотидного вектора его «внутреннюю
абстрактную характеристику – степень детерми-
нации» [9]. Степень детерминации – это число-
вая характеристика нуклеотида, связанная с его
способностью определять аминокислоту в за-
висимости от положения в кодоне, а также с так
называемым эволюционным «давлением». Кро-
ме того, принимается во внимание число водо-
родных связей.
Важным является построение именно трех
нуклеотидных кривых, которые соответствуют
каждому положению в кодоне, что дает построе-
ние трех обходов для каждого положения нуклео-
тида в триплете[10]. При учете степени детерми-
нации такая диаграмма называется триандром [9].
В вышеупомянутой работе также показано, что
гипотетическое количество нуклеотидов в кодо-
не, отличное от трех, а также случайно сгенери-
рованные нуклеотидные последовательности во-
обще не приводят к появлению таких визуальных
структур, как триандры. До настоящего времени
не существовало программ для интерактивного
построения триандров и диаграмм обхода после-
довательностей неравными по модулю векторами.
Рис. 2. Направление
и длина нуклотид-
ных векторов
5. ISSN 2219-3782. Фактори експериментальної еволюції організмів. 2015. Том 17 53
Triander – новая программа для визуального анализа нуклеотидных последовательностей
ше ширины нуклеотидной кривой (рис. 1 г), что
с одной стороны сделало диаграммы более чита-
емыми, а с другой стороны дает возможность та-
ким способом их правильно масштабировать.
Кроме того, большие диаграммы можно сме-
щать по осям координат и задавать для отображе-
ния только определенную часть последователь-
ности. Последовательность может быть отобра-
жена как в виде триандра (рис. 3 а), ветви которо-
го отображаются кривыми разной толщины, так и
обычным методом обхода ДНК, названным в про-
грамме по аналогии «монандром». Есть также во-
зможность представить последовательность век-
торами равной длины. Нужно заметить, что ско-
рости построения диаграмм достаточно для того,
чтобы наблюдать анимацию при удерживании
кнопки увеличения длины отображаемой после-
довательности или кнопок смещения ее начала.
Созданная нами программа «Triander» (рис.
3б) визуализирует нуклеотидные последователь-
ности, хранящиеся в файлах формата FASTA и
GenBank, а также в обычных текстовых файлах.
После загрузки файл доступен для просмотра и
редактирования. Диаграммы обхода ДНК строят-
ся в широко распространенном формате вектор-
ной графики SVG [11], реализована возможность
сохранения диаграмм в этом формате.
Наибольшую популярность среди мето-
дов графического представления ДНК получи-
ли двухмерные диаграммы, построенные об-
ходом последовательности векторами равной
длины. Для их построения можно использовать
как отдельные программы [12, 13], так и встроен
ные возможности более крупных проектов [14].
Такие диаграммы хорошо передают структуру
больших последовательностей, например хромо-
сом или геномов микроорганизмов. Однако по-
тери визуальной информации из-за наложения
частей нуклеотидной кривой друг на друга пре-
пятствует эффективному анализу на нуклеотид-
ном уровне.
На сегодняшний день наша программа един-
ственная способна строить триандры и диаграм-
мы обхода ДНК неравными по длине нуклеотид-
ными векторами. Это позволяет получить как об-
щее представление о последовательности, так и
различать отдельные паттерны.
Выводы
Разработанная нами программа «Triander»
позволяет строить несколько вариантов диа-
грамм понуклеотидного обхода ДНК. Примене-
ние внутренней абстрактной характеристики ос-
нования, называемой степенью детерминации,
в качестве длины нуклеотидного вектора позво-
ляет проводить как общий визуальный анализ на
уровне хромосом и геномов, так и выявлять от-
дельные нуклеотидные паттерны.
а б
Рис. 3. Диаграммы обхода последовательности DQ157859 в зависимости от положения основания в кодоне:
а – триандр кодирующей области гена сахарозо-фосфат-синтаза 2 Physcomitrella patens (PpSPS2); б – главное
окно программы «Triander», представляющее обход последовательности равными по модулю нуклеотидными
векторами
6. 54 ISSN 2219-3782. Фактори експериментальної еволюції організмів. 2015. Том 17
Дуплий В.П., Дуплий С.А.
Литература
1. Nakamura Y., Gojobori T., Ikemura T. Codon usage tabulated from international DNA sequence databases: Status for the year 2000
// Nucl. Acds. Res. – 2000. – 28. – P. 292.
2. Lazarus – The professional Free Pascal RAD IDE [Электронный ресурс]. – 2015. – Режим доступа: http://www.lazarus-ide.org.
3. Free Pascal [Электронный ресурс]. – 2015. – Режим доступа: http://www.freepascal.org.
4. Cowin J.E., Jellis C.H., Rickwood D. A new method of representing DNA sequences which combines ease of visual analysis with
machine readability // Nucleic Acids Res. – 1986. – 14, N 1. – P. 509–515.
5. Hamori E., Ruskin J.H., Curves A Novel Method of Representation of Nucleotide Series Especially Suited for Long DNA
Sequences // J. Biol. Chem. – 1983. – 258, N 2. – P. 1318–1327.
6. Gates M.A. Simpler DNA sequence representations // Nature. – 1985. – 316. – P. 219–219.
7. Lobry J.R. Genomic landscapes // Microbiology Today. – 1999. – 26. – P. 164–165.
8. Duplij D., Duplij S. DNA sequence representation by trianders and determinative degree of nucleotides // J Zhejiang Univ Sci B. –
2005. – 6, N 8. – P. 743–755.
9. Duplij D., Duplij S. Symmetry analysis of genetic code and determinative degree // Biophysical Bull. Kharkov Univ. – 2000. –
488. – P. 60–70.
10. Cebrat S., Dudek M. The effect of DNA phase structure on DNA walks // The European Physical Journal B – Condensed Matter
and Complex Systems. EDP Sciences. – 1998. – 3, N 2. – P. 271–276.
11. Scalable Vector Graphics (SVG) 1.1 (Second Edition) l [Электронный ресурс]. – 2015. – Режим доступа: http://www.w3.org/
TR/SVG.
12. GenPatterns [Электронный ресурс]. – 2015. – Режим доступа: http://math.nist.gov/~FHunt/GenPatterns/.
13. DNA walking with Icarus [Электронный ресурс]. – 2015. – Режим доступа: http://www.cs.nott.ac.uk/~jvb/icarus/.
14. Arakawa K., Tamaki S., Kono N., Kido N., Ikegami K., Ogawa R., Tomita M. Genome Projector: zoomable genome map with
multiple views // BMC Bioinformatics. – 2009. – 10 – EP. 31.
Duplij v.p. 1
, Duplij S.A. 2
1
Institute of Cell Biology and Genetic Engineering of Natl. Acad. Sci. of Ukraine,
Ukraine, 03143, Kyiv, Akademika Zabolotnoho str., 148, e-mail: duplijv@icbge.org.ua
2
Mathematical Institute, University of Muenster,
Germany, 48149, Muenster, Einsteinstrasse, 62, e-mail: duplijs@uni-muenster.de
Triander – a new program for the visual analysis of the nucleotide
sequence
Aims. Our project aimed to work out the interactive software for nucleotide sequence visualization. Methods. The program
named as “Triander” was worked out under Free Pascal RAD IDE Lazarus. Source code and compiled for Windows
binaries are freely accessible at http://icbge.org.ua/ukr/Triander. Results. This program can produce four types of plots. It
is possible to build three DNA walks done independently for each nucleotide position in triplets. The usage of not equal
in modulus nucleotide vectors lead to significant reduction of visual information loss in DNA walks. Conclusions. The
program can be used in the investigation of fine structure of sequences and find in them standard patterns and nontrivial
regions for further detail analysis.
Keywords: DNA walk, triander, determinative degree, software.