Transformations of Assembly Number for 4-Regular Graphs

A. E. Guterman; E. M. Kreines; N. V. Ostroukhova

doi:10.1007/s10958-022-05795-y

Transformations of Assembly Number for 4-Regular Graphs

A. E. Guterman, E. M. Kreines, N. V. Ostroukhova

Research output: Contribution to journal › Article › peer-review

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 their assembly numbers or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled cord graph in order to increase its assembly number by 1 is computed.

Original language	English
Pages (from-to)	11-26
Number of pages	16
Journal	Journal of Mathematical Sciences
Volume	262
Issue number	1
DOIs	https://doi.org/10.1007/s10958-022-05795-y
State	Published - Mar 2022
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

Access to Document

10.1007/s10958-022-05795-y

Cite this

@article{f872b15af90d419ca49ba18ea99f96fa,

title = "Transformations of Assembly Number for 4-Regular Graphs",

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 their assembly numbers or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled cord graph in order to increase its assembly number by 1 is computed.",

author = "Guterman, {A. E.} and Kreines, {E. M.} and Ostroukhova, {N. V.}",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Nature Switzerland AG.",

year = "2022",

month = mar,

doi = "10.1007/s10958-022-05795-y",

language = "אנגלית",

volume = "262",

pages = "11--26",

journal = "Journal of Mathematical Sciences",

issn = "1072-3374",

publisher = "Springer Science and Business Media Deutschland GmbH",

number = "1",

}

TY - JOUR

T1 - Transformations of Assembly Number for 4-Regular Graphs

AU - Guterman, A. E.

AU - Kreines, E. M.

AU - Ostroukhova, N. V.

PY - 2022/3

Y1 - 2022/3

N2 - 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 their assembly numbers or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled cord graph in order to increase its assembly number by 1 is computed.

AB - 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 their assembly numbers or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled cord graph in order to increase its assembly number by 1 is computed.

UR - http://www.scopus.com/inward/record.url?scp=85128857516&partnerID=8YFLogxK

U2 - 10.1007/s10958-022-05795-y

DO - 10.1007/s10958-022-05795-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85128857516

SN - 1072-3374

VL - 262

SP - 11

EP - 26

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

IS - 1

ER -

Transformations of Assembly Number for 4-Regular Graphs

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this