id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ajst-14703	Adebayo Femi Samuel; Zhang, Diping	Efficient Genome Assembly Studies Using Overlap and Hamiltonian Graphs	2023	7	.pdf	application/pdf	4297	272	61	We propose innovative methods for employing graph theory in DNA sequencing and investigate the application of graphs such as overlap graphs and Hamiltonian graphs in genome sequencing, along with their associated advantages and limitations. An exact one-time pass through each vertex characterizes a Hamiltonian walk-in graph G. We first show the very famous theorems for Hamiltonian graph: Dirac's Theorem - If G is a simple graph with n vertices, where n ≥ 3, If deg(v) ≥ n for each vertex v, then the graph G is Hamiltonian graph .(Dirac, G.A., 1952)	cache/ajst-14703.pdf	txt/ajst-14703.txt