Technical Report Number
This paper describes the shortest common matching string problem, which arises from a data analysis problem in molecular genetics, and shows that it is NP-complete.
Turner, Jonathan S., "The Complexity of the Shortest Common Matching String Problem" Report Number: WUCS-86-09 (1986). All Computer Science and Engineering Research.
Permanent URL: http://dx.doi.org/10.7936/K74B2ZMB