Java implementation for longest common substring of n strings

java longest-substring
user1628340 picture user1628340 · Jun 17, 2013 · Viewed 11.3k times · Source

I need to find the longest common substring of n strings and use the result in my project.

Is there any existing implementation/library in java which already does this?

Answer

dedek picture dedek · Mar 7, 2015

What about concurrent-trees ?

It is a small (~100 KB) library available in Maven Central. The algorithm uses combination of Radix and Suffix Trees. Which is known to have a linear time complexity (wikipedia).

public static String getLongestCommonSubstring(Collection<String> strings) {
    LCSubstringSolver solver = new LCSubstringSolver(new DefaultCharSequenceNodeFactory());
    for (String s: strings) {
        solver.add(s);
    }
    return solver.getLongestCommonSubstring().toString();
}

Related questions

How do I convert a String to an int in Java?

How can I convert a String to an int in Java? My String contains only numbers, and I want to return the number it represents. For example, given the string "1234" the result should be the number 1234.

Read More
How do I declare and initialize an array in Java?

How do I declare and initialize an array in Java?

Read More
How do I generate random integers within a specific range in Java?

How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum); // Bug: `randomNum` can be bigger than `maximum`. Attempt 2: Random rn = new …

Read More