DNA paired fragment assembly using graph theory
From MaRDI portal
(Redirected from Publication:1662696)
Recommendations
- Modified classical graph algorithms for the DNA fragment assembly problem
- Applications of graph theory in DNA sequencing by hybridization
- DNA sequence assembly involving an acyclic graph model
- Graph theoretic approach to parallel gene assembly
- DNA fragment assembly using a grid-based genetic algorithm
- DNA recombination through assembly graphs
- An Eulerian path approach to DNA fragment assembly
- DNA computing of bipartite graphs for maximum matching
- scientific article; zbMATH DE number 5526120
Cites work
Cited in
(12)- Graph theory analysis of genomics problems: Community analysis of fragile sites correlations and of pseudogenes alignments
- An Eulerian path approach to DNA fragment assembly
- The adjoints of DNA graphs
- A study of computational genome assembly by graph theory
- scientific article; zbMATH DE number 2086218 (Why is no real title available?)
- scientific article; zbMATH DE number 6282157 (Why is no real title available?)
- Graph algorithms for DNA sequencing -- origins, current models and the future
- scientific article; zbMATH DE number 1738644 (Why is no real title available?)
- Modified classical graph algorithms for the DNA fragment assembly problem
- DNA fragments assembly programs: A comparative study
- DNA fragment assembly using a grid-based genetic algorithm
- Gene assembly through cyclic graph decomposition
This page was built for publication: DNA paired fragment assembly using graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662696)