N. Mhaskar

activity

20202026

most citedPractical KMP/BM Style Pattern-Matching on Indeterminate Strings

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Efficient Algorithms to Compute Closed Substrings

Samkith K Jain, Neerja Mhaskar

A closed string $u$ is either of length one or contains a border that occurs only as a prefix and as a suffix in $u$ and nowhere else within $u$ . 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 $S = {s_{1}, s_{2}, \dots, s_{m}}$ of $m \geq 2$ strings is a key problem in computational biology, such as identif…