Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem

Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem

DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled. In this study, we present some graph theoretical linear time algorithms to solve the problem. To achieve linear time complexity, a hea...

Full description

Bibliographic Details
Main Authors: Guillermo M. Mallén-Fullerton, J. Emilio Quiroz-Ibarra, Antonio Miranda, Guillermo Fernández-Anaya
Format: Article
Language:English
Published: MDPI AG 2015-09-01
Series:Algorithms
Subjects:
DNA fragment assembly
minimum spanning tree
heap
linear complexity
Online Access:http://www.mdpi.com/1999-4893/8/3/754

Internet

http://www.mdpi.com/1999-4893/8/3/754

Similar Items