Cite
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.
MLA
Arnold, Michael, and Enno Ohlebusch. “Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.” Algorithmica, vol. 60, no. 4, Aug. 2011, pp. 806–18. EBSCOhost, https://doi.org/10.1007/s00453-009-9369-1.
APA
Arnold, M., & Ohlebusch, E. (2011). Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica, 60(4), 806–818. https://doi.org/10.1007/s00453-009-9369-1
Chicago
Arnold, Michael, and Enno Ohlebusch. 2011. “Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.” Algorithmica 60 (4): 806–18. doi:10.1007/s00453-009-9369-1.