Feizabadi, R., Bagherian, M., Vaziri, H., & Salahi, M. (2024). PLEACH: A new heuristic algorithm for pure parsimony haplotyping problem. Journal of Supercomputing, 80(6), 8236. https://doi.org/10.1007/s11227-023-05746-7
Chicago Style (17th ed.) CitationFeizabadi, Reza, Mehri Bagherian, Hamidreza Vaziri, and Maziar Salahi. "PLEACH: A New Heuristic Algorithm for Pure Parsimony Haplotyping Problem." Journal of Supercomputing 80, no. 6 (2024): 8236. https://doi.org/10.1007/s11227-023-05746-7.
MLA (9th ed.) CitationFeizabadi, Reza, et al. "PLEACH: A New Heuristic Algorithm for Pure Parsimony Haplotyping Problem." Journal of Supercomputing, vol. 80, no. 6, 2024, p. 8236, https://doi.org/10.1007/s11227-023-05746-7.
Warning: These citations may not always be 100% accurate.