Transformations of assembly number for 4-regular graphs

DOI10.1007/S10958-022-05795-YMaRDI QIDQ2146531zbMATH OpenOpenAlexFDO

Authors E. M. Kreines, N. V. Ostroukhova, Alexander Guterman

Publication date 16 June 2022

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-022-05795-y

zbMATH Keywords

assembly graphsDNA recombination in living cells

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30)

Recommendations

• Four-regular graphs with rigid vertices associated to DNA recombination
• DNA recombination through assembly graphs
• Graph Polynomials Motivated by Gene Rearrangements in Ciliates
• Invariants of graphs modeling nucleotide rearrangements
• Graphs associated with DNA rearrangements and their polynomials

Cites work

• Computation in living cells. Gene assembly in ciliates
• DNA recombination through assembly graphs
• Double occurrence words: their graphs and matrices
• Four-regular graphs with rigid vertices associated to DNA recombination
• Insertions yielding equivalent double occurrence words
• On the realization of double occurrence words

Cited in

(3)

• How to build a graph in \(n\) days: some variations of graph assembly
• scientific article; zbMATH DE number 512928 (Why is no real title available?)
• DNA recombination through assembly graphs

This page was built for publication: Transformations of assembly number for 4-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146531)