APA (7th ed.) Citation

Salmela, L. (2012). Average complexity of backward q-gram string matching algorithms. Information processing letters, 112(11), 433-437. https://doi.org/10.1016/j.ipl.2012.02.010

Chicago Style (17th ed.) Citation

Salmela, Leena. "Average Complexity of Backward Q-gram String Matching Algorithms." Information Processing Letters 112, no. 11 (2012): 433-437. https://doi.org/10.1016/j.ipl.2012.02.010.

MLA (9th ed.) Citation

Salmela, Leena. "Average Complexity of Backward Q-gram String Matching Algorithms." Information Processing Letters, vol. 112, no. 11, 2012, pp. 433-437, https://doi.org/10.1016/j.ipl.2012.02.010.