Cite
Efficient computation of longest single-arm-gapped palindromes in a string.
MLA
Narisada, Shintaro, et al. “Efficient Computation of Longest Single-Arm-Gapped Palindromes in a String.” Theoretical Computer Science, vol. 812, Apr. 2020, pp. 160–73. EBSCOhost, https://doi.org/10.1016/j.tcs.2019.10.025.
APA
Narisada, S., Hendrian, D., Narisawa, K., Inenaga, S., & Shinohara, A. (2020). Efficient computation of longest single-arm-gapped palindromes in a string. Theoretical Computer Science, 812, 160–173. https://doi.org/10.1016/j.tcs.2019.10.025
Chicago
Narisada, Shintaro, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, and Ayumi Shinohara. 2020. “Efficient Computation of Longest Single-Arm-Gapped Palindromes in a String.” Theoretical Computer Science 812 (April): 160–73. doi:10.1016/j.tcs.2019.10.025.