A study of computational genome assembly by graph theory

DOI10.2478/AWUTM-2024-0001MaRDI QIDQ6494182

Bijan Sarkar

Publication date: 29 April 2024

Published in: Analele Universității de Vest din Timișoara. Seria Matematică-Informatică (Search for Journal in Brave)

zbMATH Keywords

de Bruijn graphsgenome assemblyde novo assemblybidirectional bipartite graphsSpades assemblerVelvet assembler

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Coloring of graphs and hypergraphs (05C15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (05Cxx) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• DNA paired fragment assembly using graph theory
• Graph algorithms for DNA sequencing -- origins, current models and the future
• An Eulerian path approach to DNA fragment assembly

This page was built for publication: A study of computational genome assembly by graph theory