DNA paired fragment assembly using graph theory
From MaRDI portal
Publication:1662696
DOI10.3390/A10020036zbMATH Open1461.92076OpenAlexW2597599540MaRDI QIDQ1662696FDOQ1662696
Authors: J. Emilio Quiroz-Ibarra, Guillermo M. Mallén-Fullerton, Guillermo Fernández-Anaya 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10020036
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
Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Cites Work
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph algorithms for DNA sequencing -- origins, current models and the future
- DNA fragments assembly programs: A comparative study
- Modified classical graph algorithms for the DNA fragment assembly problem
- A study of computational genome assembly by graph theory
- Graph theory analysis of genomics problems: Community analysis of fragile sites correlations and of pseudogenes alignments
- Gene assembly through cyclic graph decomposition
- DNA fragment assembly using a grid-based genetic algorithm
- The adjoints of DNA graphs
- An Eulerian path approach to DNA fragment assembly
Uses Software
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)
