Cita APA

Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Anytime algorithms for the longest common palindromic subsequence problem.

Citación estilo Chicago

Djukanovic, Marco, Günther R. Raidl, y Christian Blum. Anytime Algorithms for the Longest Common Palindromic Subsequence Problem. 2020.

Cita MLA

Djukanovic, Marco, Günther R. Raidl, y Christian Blum. Anytime Algorithms for the Longest Common Palindromic Subsequence Problem. 2020.