|
Zapiski Nauchnykh Seminarov POMI, 2021, Volume 504, Pages 21–46
(Mi znsl7108)
|
|
|
|
Transformations of assembly number for 4-regular graphs
A. E. Gutermanabc, E. M. Kreinescb, N. V. Ostroukhovab a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b Lomonosov Moscow State University
c Moscow Center for Fundamental and Applied Mathematics
Abstract:
Simple assembly graphs characterize the process of DNA recombination in living cells. The assembly number, number of distinct Hamiltonian sets of polygonal paths, one-sided and middle additivity of a graph are important characteristics of such graphs. This paper investigates transformations of simple assembly graphs that allow one to increase the assembly number or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled chord graph in order to increase its assembly number by 1 is computed.
Key words and phrases:
assembly graphs, doubly occurrence words, assembly number.
Received: 13.10.2021
Citation:
A. E. Guterman, E. M. Kreines, N. V. Ostroukhova, “Transformations of assembly number for 4-regular graphs”, Computational methods and algorithms. Part XXXIV, Zap. Nauchn. Sem. POMI, 504, POMI, St. Petersburg, 2021, 21–46
Linking options:
https://www.mathnet.ru/eng/znsl7108 https://www.mathnet.ru/eng/znsl/v504/p21
|
Statistics & downloads: |
Abstract page: | 98 | Full-text PDF : | 22 | References: | 19 |
|