public class LongestCommonSubstring extends Object
LongestCommonSubstring
class provides a SuffixArray
client for computing the longest common substring that appears in two
given strings.
This implementation computes the suffix array of each string and applies a merging operation to determine the longest common substring. For an alternate implementation, see LongestCommonSubstringConcatenate.java.
For additional documentation, see Section 6.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
public static String lcs(String s, String t)
s
- one stringt
- the other strings
and t
; the empty string
if no such stringpublic static void main(String[] args)
lcs()
method.
Reads in two strings from files specified as command-line arguments;
computes the longest common substring; and prints the results to
standard output.args
- the command-line arguments