DNA Paired Fragment Assembly Using Graph Theory
AbstractDNA fragment assembly requirements have generated an important computational problem created by their structure and the volume of data. Therefore, it is important to develop algorithms able to produce high-quality information that use computer resources efficiently. Such an algorithm, using graph theory, is introduced in the present article. We first determine the overlaps between DNA fragments, obtaining the edges of a directed graph; with this information, the next step is to construct an adjacency list with some particularities. Using the adjacency list, it is possible to obtain the DNA contigs (group of assembled fragments building a contiguous element) using graph theory. We performed a set of experiments on real DNA data and compared our results to those obtained with common assemblers (Edena and Velvet). Finally, we searched the contigs in the original genome, in our results and in those of Edena and Velvet. View Full-Text
Share & Cite This Article
Quiroz-Ibarra, J.E.; Mallén-Fullerton, G.M.; Fernández-Anaya, G. DNA Paired Fragment Assembly Using Graph Theory. Algorithms 2017, 10, 36.
Quiroz-Ibarra JE, Mallén-Fullerton GM, Fernández-Anaya G. DNA Paired Fragment Assembly Using Graph Theory. Algorithms. 2017; 10(2):36.Chicago/Turabian Style
Quiroz-Ibarra, J. E.; Mallén-Fullerton, Guillermo M.; Fernández-Anaya, Guillermo. 2017. "DNA Paired Fragment Assembly Using Graph Theory." Algorithms 10, no. 2: 36.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.