DNA paired fragment assembly using graph theory

DOI10.3390/a10020036zbMath1461.92076OpenAlexW2597599540MaRDI QIDQ1662696

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

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

DNA fragment assemblygraph theory algorithmstrie data structure

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (1)

Modified classical graph algorithms for the DNA fragment assembly problem

Uses Software

• Velvet
• QUAST
• MUMMER
• Genomatix

Cites Work

• Modified classical graph algorithms for the DNA fragment assembly problem
• On-line construction of suffix trees
• When the greedy algorithm fails

This page was built for publication: DNA paired fragment assembly using graph theory