A comparison of the algorithms on simulated mutation data with varying passenger mutation probability .
收藏NIAID Data Ecosystem2026-03-07 收录
下载链接:
https://figshare.com/articles/dataset/_A_comparison_of_the_algorithms_on_simulated_mutation_data_with_varying_passenger_mutation_probability_/706392
下载链接
链接失效反馈官方服务:
资源简介:
Italicized rows correspond to values of approximated from real cancer datasets. Each entry is mean () and standard deviation () (across 1000 simulations) of the distance between the planted set of pathways and the collections found by each algorithm. The minimum distance indicates an algorithm found the planted pathways exactly, while the maximum distance indicates that an algorithm did not find any of the genes in the planted pathways. Bold text indicates the top performing algorithm for each value of . Multi-Dendrix is the top performer for all values of except the smallest . The differences between Multi-Dendrix and both Iter-Dendrix and Iter-RME are statistically significant () for . For , Iter-RME did not complete after 24 hours of runtime.
创建时间:
2013-05-23



