1.
A greedy approach for computing longest common subsequences. JPRM [Internet]. 2008 Dec. 31 [cited 2025 Sep. 19];4(1):165 – 170. Available from: https://jprm.sms.edu.pk/index.php/jprm/article/view/45