Suffix Trees based Diff Java Applet

Suffix Trees based Diff Java Applet:

• enter 2 strings;
• press "Identical" button to find identical parts of 2 strings;
  
• more information about how it works could be found here - Suffix Trees: Longest Common Substring and Diff Implementation.

See also: my other Suffix Trees posts

Generalized Suffix Trees: Java Applet

A Generalized Suffix Tree is a Suffix Tree for a set of strings.
Usage of Generalized Suffix Trees Java Applet is similar to Suffix Trees Java Applet:

• enter 2 strings;
• # and $ are used as strings terminators;
• press "Build GST" button;
• it will build suffix tree and create visual presentation in some auto calculated layout;
• drag and drop nodes to find best layout;
• you need Java installed and enabled in your browser;
• applet uses Java implementation of Ukkonen's Algorithm to build Suffix Tree.

Here are most used examples of Generalized Suffix Trees:



Source code of GeneralizedSuffixTree class that is based on SuffixTree class.

public class GeneralizedSuffixTree {
    // SOH - START OF HEADING
    public static final char TERMINATOR1 = '\u0001';
    // STX - START OF TEXT
    public static final char TERMINATOR2 = '\u0002';
   
    private String texts[];
    private char terminators[];
   
    private String generalized;
    private SuffixTree suffixTree;
   
    public GeneralizedSuffixTree(String text1, String text2) {
        this(text1, text2, TERMINATOR1, TERMINATOR2);
    }
   
    public GeneralizedSuffixTree(String text1, String text2, char terminator1, char terminator2) {
        this(new String[]{text1, text2}, new char[]{terminator1, terminator2});
    }
   
    public GeneralizedSuffixTree(String texts[], char terminators[]) {
        this.texts = texts;
        this.terminators = terminators;
   
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < texts.length; i++) {
            sb.append(texts[i]);
            sb.append(terminators[i]);
        }
        generalized = sb.toString();
        suffixTree = new SuffixTree(generalized);
        fixSpanSuffixes(suffixTree.getRootNode());
    }
   
    private void fixSpanSuffixes(Node node) {
        for (Edge edge : node.getEdges()) {
            for (int i = 0; i < texts.length; i++) {
                if ((edge.getBeginIndex() <= getGeneralizedSubstringLength(i)) &&
                        (edge.getEndIndex() > getGeneralizedSubstringLength(i))) {
   
                    edge.setEndIndex(getGeneralizedSubstringLength(i));
                    continue;
                }
            }
            fixSpanSuffixes(edge.getEndNode());
        }
    }
   
    private int getGeneralizedSubstringLength(int n) {
        int length = 0;
        for (int i = 0; i <= n; i++) {
            length += texts[i].length() + 1;
        }
        return length - 1;
    }
}

See also: my other Suffix Trees posts

Suffix Trees: Java Applet

How to use Suffix Trees Java Applet:

• enter string;
• press "Build Suffix Tree" button;
• it will build suffix tree and create visual presentation in some auto calculated layout;
• drag and drop nodes to find best layout;
• you need Java installed and enabled in your browser;
• applet uses Java implementation of Ukkonen's Algorithm.

Some samples are available here.

Applet sources are discussed and could be download here.

Please refer previous posts about Suffix Trees:

• Suffix Trees: Java Code as Separate Classes
• Suffix Trees: Refactored Java Code
• Suffix Trees: Java Ukkonen's Algorithm