2.4k citations · 2.7k across the 32 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Computing a Longest Common Palindromic Subsequence
Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal +1
The {\em longest common subsequence (LCS)} problem is a classic and well-studied problem in computer science. Palindrome is a word which reads the same forward as it does backward.…
cs.DS2011
Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet
Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman +1
Covers being one of the most popular form of regularities in strings, have drawn much attention over time. In this paper, we focus on the problem of linear time inference of string…