International Conference on Advances in Bio-Informatics and Environmental Engineering - ICABEE 2014
Author(s) : DIO FENG-YU CHUNG , JACK DAO-JIE LI , KUN-YU HUNG , MICHAEL SHAN-HUI HO , PAUL PIN-SHUO HUANG
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.