1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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…
cs.DS2024
V-Words, Lyndon Words and Galois Words
Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth
We say that a family of strings over forms a Unique Maximal Factorization Family (UMFF) if and only if every has a unique maximal factorizat…
cs.DS2020★ 1 cited
A New Approach to Regular & Indeterminate Strings
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist…