Ekim, B., Berger, B., & Orenstein, Y. (2020). A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets. Research in computational molecular biology : ... Annual International Conference, RECOMB ... : proceedings. RECOMB (Conference : 2005- ), 12074, 37. https://doi.org/10.1007/978-3-030-45257-5_3
Citace podle Chicago (17th ed.)Ekim, Barış, Bonnie Berger, a Yaron Orenstein. "A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets." Research in Computational Molecular Biology : ... Annual International Conference, RECOMB ... : Proceedings. RECOMB (Conference : 2005- ) 12074 (2020): 37. https://doi.org/10.1007/978-3-030-45257-5_3.
Citace podle MLA (9th ed.)Ekim, Barış, et al. "A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets." Research in Computational Molecular Biology : ... Annual International Conference, RECOMB ... : Proceedings. RECOMB (Conference : 2005- ), vol. 12074, 2020, p. 37, https://doi.org/10.1007/978-3-030-45257-5_3.