Abstract
Let S be a finite set of strings and let T be a subset of S. A characteristic string of T under S is a string that is a common substring of T and that is not a substring of any string in S-T. We present a lineartime algorithm for deciding whether or not there exists a characteristic string of T under S. If such a string exists, then the algorithm returns all the shortest characteristic strings of T under S in that time.
Author supplied keywords
Cite
CITATION STYLE
Nakanishi, M., Hasidume, M., Ito, M., & Hashimoto, A. (1994). A linear-time algorithm for computing characteristic strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 315–323). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_195
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
