2 papers
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.DS2022
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…