A Greedy Algorithm for Detecting Mutually Exclusive Patterns in Cancer Mutation Data

Author(s):  
Chunyan Yang ◽  
Tian Zheng ◽  
Zhongmeng Zhao ◽  
Xinnuo He ◽  
Xuanping Zhang ◽  
...  
2020 ◽  
Author(s):  
Rodrigo Ramos ◽  
Jorge Cutigi ◽  
Cynthia Ferreira ◽  
Adriane Evangelista ◽  
Adenilso Simão

With the advancements of next-generation sequencing (NGS) technologies, a massive volume of genetic data has been generated. It makes possible the study of complex disease by computational approaches. In the context of cancer, there is a huge variety of mutation data in public databases. However, it is not feasible to use all available data in every analysis; thus, a data subset must be selected. This work is aiming to investigate and understand the mutational characteristics presented in different cancer mutation data sets of the same type of cancer. To achieve this goal, exploration and visualization of cancer mutation data were performed. Several analyses are presented for three common types of cancer: 1) Breast Invasive Carcinoma (BRCA); 2) Lung Adenocarcinoma (LUAD); and Prostate Adenocarcinoma (PRAD). For each cancer type, three distinct data sets were analyzed in order to understand if there are significant differences or similarities among them. The analyses show that BRCA and LUAD have evidence of similarity among their data sets, while PRAD is likely heterogeneous.


2010 ◽  
Vol 11 (11) ◽  
pp. R112 ◽  
Author(s):  
Simina M Boca ◽  
Kenneth W Kinzler ◽  
Victor E Velculescu ◽  
Bert Vogelstein ◽  
Giovanni Parmigiani

CCIT Journal ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 170-176
Author(s):  
Anggit Dwi Hartanto ◽  
Aji Surya Mandala ◽  
Dimas Rio P.L. ◽  
Sidiq Aminudin ◽  
Andika Yudirianto

Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving problems that is a minimum route problem on ghost pacman, where ghost plays a role chase player. The dijkstra algorithm uses a principle similar to the greedy algorithm where it starts from the first point and the next point is connected to get to the destination, how to compare numbers starting from the starting point and then see the next node if connected then matches one path with the path). From the results of the testing phase, it was found that the dijkstra algorithm is quite good at solving the minimum route solution to pursue the player, namely by getting a value of 13 according to manual calculations


Sign in / Sign up

Export Citation Format

Share Document