DNA recombination through assembly graphs
From MaRDI portal
Publication:967356
DOI10.1016/j.dam.2009.06.011zbMath1211.05171OpenAlexW2113328244MaRDI QIDQ967356
Nataša Jonoska, Angela Angeleska, Masahico Saito
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.011
smoothingpolygonal pathassembly graphscilitesDNA rearrangementsrecombination processsimultaneous smoothingvirtual knot diagrams
Applications of graph theory (05C90) Relations of low-dimensional topology with graph theory (57M15) Genetics and epigenetics (92D10)
Related Items (11)
Transformations of assembly number for 4-regular graphs ⋮ Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax} ⋮ Graph of fuzzy topographic topological mapping in relation to \(k\)-Fibonacci sequence ⋮ Genus ranges of 4-regular rigid vertex graphs ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Topological analysis of enzymatic actions on DNA polyhedral links ⋮ Double occurrence words: their graphs and matrices ⋮ Four-regular graphs with rigid vertices associated to DNA recombination ⋮ Rewriting rule chains modeling DNA rearrangement pathways ⋮ Invariants of Graphs Modeling Nucleotide Rearrangements ⋮ Symbol Separation in Double Occurrence Words
Cites Work
This page was built for publication: DNA recombination through assembly graphs