2 papers
cs.DS2026
Efficient Algorithms to Compute Closed Substrings
Samkith K Jain, Neerja Mhaskar
A closed string is either of length one or contains a border that occurs only as a prefix and as a suffix in and nowhere else within . In this paper, we present fast $\m…
cs.DS2025
On the Complexity of Finding Approximate LCS of Multiple Strings
Hamed Hasibi, Neerja Mhaskar, W. F. Smyth
Finding an Approximate Longest Common Substring (ALCS) within a given set of strings is a key problem in computational biology, such as identif…