APA (7th ed.) Citation

Shikder, R., Thulasiraman, P., Irani, P., & Hu, P. (2019). An OpenMP-based tool for finding longest common subsequence in bioinformatics. BMC research notes, 12(1), 220-6. https://doi.org/10.1186/s13104-019-4256-6

Chicago Style (17th ed.) Citation

Shikder, Rayhan, Parimala Thulasiraman, Pourang Irani, and Pingzhao Hu. "An OpenMP-based Tool for Finding Longest Common Subsequence in Bioinformatics." BMC Research Notes 12, no. 1 (2019): 220-6. https://doi.org/10.1186/s13104-019-4256-6.

MLA (9th ed.) Citation

Shikder, Rayhan, et al. "An OpenMP-based Tool for Finding Longest Common Subsequence in Bioinformatics." BMC Research Notes, vol. 12, no. 1, 2019, pp. 220-6, https://doi.org/10.1186/s13104-019-4256-6.