Four-regular graphs with rigid vertices associated to DNA recombination

DOI10.1016/j.dam.2013.01.003zbMath1287.05063OpenAlexW1987592666MaRDI QIDQ2446317

Jonathan Burns, Masahico Saito, Tilahun Muche, Egor Dolzhenko, Nataša Jonoska

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.01.003

zbMATH Keywords

polynomial invariantDNA recombinationrigid verticesassembly numbersdouble occurrence wordsfour-regular graphsHamiltonian polygonal path

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (6)

Transformations of assembly number for 4-regular graphs ⋮ Graph of fuzzy topographic topological mapping in relation to \(k\)-Fibonacci sequence ⋮ Genus ranges of 4-regular rigid vertex graphs ⋮ Double occurrence words: their graphs and matrices ⋮ Invariants of Graphs Modeling Nucleotide Rearrangements ⋮ Symbol Separation in Double Occurrence Words

Uses Software

• OEIS

Cites Work

• DNA recombination through assembly graphs
• On a class of linked diagrams. I: Enumeration
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Gene assembly through cyclic graph decomposition
• Computation in living cells. Gene assembly in ciliates
• Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates
• RNA-guided DNA assembly
• Khovanov's homology for tangles and cobordisms
• An Eulerian path approach to DNA fragment assembly
• Sur Un Problème De Configurations Et Sur Les Fractions Continues
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Four-regular graphs with rigid vertices associated to DNA recombination