2 citations · 3 across the 4 of their papers we have counts for
7 papers
Boyer-Moore Variants for Indeterminate String Matching and Experimental Evaluation
Neerja Mhaskar, Nivetha Raj Pappuraj
We study exact pattern matching on indeterminate strings, where a text or pattern position may represent a set of symbols rather than a single letter. Focusing on Boyer-Moore-style…
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…
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…
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…
String Covering: A Survey
Neerja Mhaskar, W. F. Smyth
The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact repr…
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
Hossein Dehghani, Neerja Mhaskar, W. F. Smyth
In this paper we describe two simple, fast, space-efficient algorithms for finding all matches of an indeterminate pattern in an indeterminate string , w…
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…