Constructing a Fast Bioinformatics Algorithm to Solve Cancer Genome Assembly Using Enhanced Euler Path on Constructed De Bruijn Bioinformatics Graph

DIO FENG-YU, CHUNG and JACK DAO-, JIE LI and KUN-YU, HUNG and MICHAEL, SHAN-HUI HO and PAUL PIN-, SHUO HUANG (2014) Constructing a Fast Bioinformatics Algorithm to Solve Cancer Genome Assembly Using Enhanced Euler Path on Constructed De Bruijn Bioinformatics Graph. In: International Conference on Advances in Bio-Informatics and Environmental Engineering - ICABEE 2014, 07- 08 June,2014, Rome, Italy.

[img]
Preview
Text
20140710_122033.pdf - Published Version

Download (865kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/3...

Abstract

Cancer is defined as a disease that involves changes or mutations in the cell genome. Cancer genome sequencing has been recognized as a NP problem. Cancer genome sequencing includes cancer genome assembly and cancer genome alignment is through early detection improving survival opportunity of cancer patients. In this research, a bioinformatics approach uses a proposed modified Euler path on a constructed De Bruijn cancer genome graph for solving cancer genome assembly. This fast DNA algorithm fully utilizes parallelism to conquer time complexity bottleneck, and improves any cancer genome Assembly more efficient. The experimental results of cancer genome reassemble is estimated in O(n3) polynomial bound.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Cancer Genome Assembly; Cancer Genome Alignment; De Bruijn Graphs; Euler Path
Depositing User: Mr. John Steve
Date Deposited: 21 May 2019 09:09
Last Modified: 21 May 2019 09:09
URI: http://publications.theired.org/id/eprint/2577

Actions (login required)

View Item View Item