Modified classical graph algorithms for the DNA fragment assembly problem

DOI10.3390/a8030754zbMath1461.68159OpenAlexW1680609855MaRDI QIDQ1736710

J. Emilio Quiroz-Ibarra, Guillermo M. Mallén-Fullerton, 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

zbMATH Keywords

minimum spanning treelinear complexityheapDNA fragment assembly

Mathematics Subject Classification ID

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

Related Items (1)

DNA paired fragment assembly using graph theory

Uses Software

• GAGE

Cites Work

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

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