Abstract
In this paper we consider an approach to solve the farthest substring problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
