DNA paired fragment assembly using graph theory (Q1662696): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Genomatix / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3390/a10020036 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2597599540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When the greedy algorithm fails / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modified classical graph algorithms for the DNA fragment assembly problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line construction of suffix trees / rank | |||
Normal rank |
Latest revision as of 09:22, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | DNA paired fragment assembly using graph theory |
scientific article |
Statements
DNA paired fragment assembly using graph theory (English)
0 references
20 August 2018
0 references
Summary: DNA 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 \textit{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 (\textit{Edena} and \textit{Velvet}). Finally, we searched the \textit{contigs} in the original genome, in our results and in those of \textit{Edena} and \textit{Velvet}.
0 references
DNA fragment assembly
0 references
trie data structure
0 references
graph theory algorithms
0 references