Modified classical graph algorithms for the DNA fragment assembly problem

DOI10.3390/A8030754zbMATH Open1461.68159OpenAlexW1680609855MaRDI QIDQ1736710FDOQ1736710

Authors: Guillermo M. Mallén-Fullerton, J. Emilio Quiroz-Ibarra, Antonio Miranda, Guillermo Fernández-Anaya 

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8030754

Recommendations

• DNA paired fragment assembly using graph theory
• DNA sequence assembly involving an acyclic graph model
• The contig assembly problem and its algorithmic solutions
• A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem
• Seeding strategies and recombination operators for solving the DNA fragment assembly problem

zbMATH Keywords

minimum spanning treelinear complexityheapDNA fragment assembly

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• On finding minimal length superstrings
• An Eulerian path approach to DNA fragment assembly
• Set Merging Algorithms
• DNA paired fragment assembly using graph theory

Cited In (6)

• Unimodular hypergraph for DNA sequencing: a polynomial time algorithm
• Seeding strategies and recombination operators for solving the DNA fragment assembly problem
• DNA sequence assembly involving an acyclic graph model
• Linear-time superbubble identification algorithm for genome assembly
• DNA paired fragment assembly using graph theory
• An Eulerian path approach to DNA fragment assembly

Uses Software

• GAGE

This page was built for publication: Modified classical graph algorithms for the DNA fragment assembly problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736710)