X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FAlignment.java;h=3a1b44a6ef095fba286bf110f71a41acc3f4b0dd;hb=32ce9ddb7ce1a68add53dd81785ae428ca136a83;hp=e513e594a62614f5e352dfd05bca2d3a64ac4a35;hpb=e7ed63f1ea56432246a6ed1553f0fe56d26f56ea;p=jalview.git

diff --git a/src/jalview/datamodel/Alignment.java b/src/jalview/datamodel/Alignment.java
index e513e59..3a1b44a 100755
--- a/src/jalview/datamodel/Alignment.java
+++ b/src/jalview/datamodel/Alignment.java
@@ -1,564 +1,738 @@
+/*
+ * Jalview - A Sequence Alignment Editor and Viewer
+ * Copyright (C) 2005 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
+ */
 package jalview.datamodel;
 
 import jalview.analysis.*;
+
 import jalview.util.*;
+
 import java.util.*;
 
+
 /** Data structure to hold and manipulate a multiple sequence alignment
  */
 public class Alignment implements AlignmentI
 {
+    protected Alignment dataset;
+    protected Vector sequences;
+    protected Vector groups = new Vector();
+    protected Vector superGroup = new Vector();
+    protected char gapCharacter = '-';
+    protected Provenance provenance;
+    protected int type = NUCLEOTIDE;
+    public static final int PROTEIN = 0;
+    public static final int NUCLEOTIDE = 1;
+
+    /** DOCUMENT ME!! */
+    public AlignmentAnnotation[] annotations;
+
+    /** DOCUMENT ME!! */
+    public boolean featuresAdded = false;
+
+    /** Make an alignment from an array of Sequences.
+     *
+     * @param sequences
+     */
+    public Alignment(SequenceI[] seqs)
+    {
+        int i=0;
 
-  protected Vector      sequences;
-  protected Vector      groups = new Vector();
-  protected ArrayList   superGroup = new ArrayList();
-  protected char        gapCharacter = '-';
-  public AlignmentAnnotation [] annotations;
-  public Conservation conservation;
-
-  public boolean featuresAdded = false;
-
-  /** Make an alignment from an array of Sequences.
-  *
-  * @param sequences
-  */
-  public Alignment(SequenceI[] seqs) {
-    sequences = new Vector();
-
-    for (int i=0; i < seqs.length; i++)
-      sequences.addElement(seqs[i]);
+        if( jalview.util.Comparison.isNucleotide(seqs))
+          type = NUCLEOTIDE;
+        else
+          type = PROTEIN;
 
-    getWidth();
-  }
+        sequences = new Vector();
 
-  public Vector      getSequences() {
-    return sequences;
-  }
+        for (i = 0; i < seqs.length; i++)
+        {
+            sequences.addElement(seqs[i]);
+        }
 
-  public SequenceI getSequenceAt(int i) {
-    if (i < sequences.size()) {
-      return (SequenceI)sequences.elementAt(i);
+        getWidth();
     }
 
-    return null;
-  }
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public Vector getSequences()
+    {
+        return sequences;
+    }
 
-  /** Adds a sequence to the alignment.  Recalculates maxLength and size.
-   *
-   * @param snew
-   */
-  public void addSequence(SequenceI snew) {
-    sequences.addElement(snew);
-  }
+    /**
+     * DOCUMENT ME!
+     *
+     * @param i DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public SequenceI getSequenceAt(int i)
+    {
+        if (i < sequences.size())
+        {
+            return (SequenceI) sequences.elementAt(i);
+        }
 
-  public void addSequence(SequenceI[] seq) {
-    for (int i=0; i < seq.length; i++) {
-      addSequence(seq[i]);
+        return null;
     }
-  }
-
-  /** Adds a sequence to the alignment.  Recalculates maxLength and size.
-    *
-   * @param snew
-   */
-  public void setSequenceAt(int i,SequenceI snew) {
-    SequenceI oldseq = getSequenceAt(i);
-    deleteSequence(oldseq);
 
-    sequences.setElementAt(snew,i);
-  }
+    /** Adds a sequence to the alignment.  Recalculates maxLength and size.
+     *
+     * @param snew
+     */
+    public void addSequence(SequenceI snew)
+    {
+        sequences.addElement(snew);
+    }
 
-  public Vector getGroups() {
-    return groups;
-  }
+    /**
+     * DOCUMENT ME!
+     *
+     * @param seq DOCUMENT ME!
+     */
+    public void addSequence(SequenceI[] seq)
+    {
+        for (int i = 0; i < seq.length; i++)
+        {
+            addSequence(seq[i]);
+        }
+    }
 
-  /** Sorts the sequences by sequence group size - largest to smallest.
-   * Uses QuickSort.
-   */
-  public void sortGroups() {
-    float[]  arr = new float [groups.size()];
-    Object[] s   = new Object[groups.size()];
+    /** Adds a sequence to the alignment.  Recalculates maxLength and size.
+     *
+     * @param snew
+     */
+    public void setSequenceAt(int i, SequenceI snew)
+    {
+        SequenceI oldseq = getSequenceAt(i);
+        deleteSequence(oldseq);
 
-    for (int i=0; i < groups.size(); i++) {
-      arr[i] = ((SequenceGroup)groups.elementAt(i)).sequences.size();
-      s[i]   = groups.elementAt(i);
+        sequences.setElementAt(snew, i);
     }
 
-    QuickSort.sort(arr,s);
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public Vector getGroups()
+    {
+        return groups;
+    }
 
-    Vector newg = new Vector(groups.size());
+    /** Takes out columns consisting entirely of gaps (-,.," ")
+     */
+    public void removeGaps()
+    {
+        SequenceI current;
+        int iSize = getWidth();
 
-    for (int i=groups.size()-1; i >= 0; i--) {
-      newg.addElement(s[i]);
+        for (int i = 0; i < iSize; i++)
+        {
+            boolean delete = true;
+
+            for (int j = 0; j < getHeight(); j++)
+            {
+                current = getSequenceAt(j);
+
+                if (current.getLength() > i)
+                {
+                    /* MC Should move this to a method somewhere */
+                    if (!jalview.util.Comparison.isGap(current.getCharAt(i)))
+                    {
+                        delete = false;
+                    }
+                }
+            }
+
+            if (delete)
+            {
+                deleteColumns(i, i);
+                iSize--;
+                i--;
+            }
+        }
     }
 
-    groups = newg;
-  }
-
-  /** Takes out columns consisting entirely of gaps (-,.," ")
-   */
-  public void removeGaps()
-  {
+    /** Removes a range of columns (start to end inclusive).
+     *
+     * @param start Start column in the alignment
+     * @param end End column in the alignment
+     */
+    public void deleteColumns(int start, int end)
+    {
+        deleteColumns(0, getHeight() - 1, start, end);
+    }
 
-    SequenceI current;
-    int iSize = getWidth();
-    for (int i=0; i < iSize; i++)
+    /**
+     * DOCUMENT ME!
+     *
+     * @param seq1 DOCUMENT ME!
+     * @param seq2 DOCUMENT ME!
+     * @param start DOCUMENT ME!
+     * @param end DOCUMENT ME!
+     */
+    public void deleteColumns(int seq1, int seq2, int start, int end)
     {
-      boolean delete = true;
-      for (int j=0; j < getHeight(); j++)
-      {
-        current = getSequenceAt(j);
-        if (current.getLength() > i)
+        for (int i = 0; i <= (end - start); i++)
         {
-	    /* MC Should move this to a method somewhere */
-          if ( !jalview.util.Comparison.isGap(current.getCharAt(i)))
-            delete = false;
-
+            for (int j = seq1; j <= seq2; j++)
+            {
+                getSequenceAt(j).deleteCharAt(start);
+            }
         }
-      }
-
-      if ( delete )
-      {
-        deleteColumns(i,i);
-        iSize--;
-        i--;
-      }
     }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @param i DOCUMENT ME!
+     */
+    public void trimLeft(int i)
+    {
+        for (int j = 0; j < getHeight(); j++)
+        {
+            SequenceI s = getSequenceAt(j);
+            int newstart = s.findPosition(i);
 
-  }
-
-  /** Returns an array of Sequences containing columns
-   * start to end (inclusive) only.
-   *
-   * @param start start column to fetch
-   * @param end end column to fetch
-   * @return Array of Sequences, ready to put into a new Alignment
-   */
-  public SequenceI[] getColumns(int start, int end) {
-    return getColumns(0,getHeight()-1,start,end);
-  }
-
-  /** Removes a range of columns (start to end inclusive).
-   *
-   * @param start Start column in the alignment
-   * @param end End column in the alignment
-   */
-  public void deleteColumns(int start, int end) {
-    deleteColumns(0,getHeight()-1,start,end);
-  }
+            s.setStart(newstart);
+            s.setSequence(s.getSequence().substring(i));
+        }
+    }
 
-  public void deleteColumns(int seq1, int seq2, int start, int end) {
+    /**
+     * DOCUMENT ME!
+     *
+     * @param i DOCUMENT ME!
+     */
+    public void trimRight(int i)
+    {
+        for (int j = 0; j < getHeight(); j++)
+        {
+            SequenceI s = getSequenceAt(j);
+            int newend = s.findPosition(i);
 
-    for (int i=0; i <= (end-start); i++) {
-      for (int j=seq1; j <= seq2; j++) {
-        getSequenceAt(j).deleteCharAt(start);
-      }
+            s.setEnd(newend);
+            s.setSequence(s.getSequence().substring(0, i + 1));
+        }
     }
-  }
-
-  public void insertColumns(SequenceI[] seqs, int pos) {
-    if (seqs.length == getHeight()) {
-      for (int i=0; i < getHeight();i++) {
-        String tmp = new String(getSequenceAt(i).getSequence());
-        getSequenceAt(i).setSequence(tmp.substring(0,pos) + seqs[i].getSequence() + tmp.substring(pos));
-      }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @param s DOCUMENT ME!
+     */
+    public void deleteSequence(SequenceI s)
+    {
+        for (int i = 0; i < getHeight(); i++)
+        {
+            if (getSequenceAt(i) == s)
+            {
+                deleteSequence(i);
+            }
+        }
     }
-  }
 
-  public SequenceI[] getColumns(int seq1, int seq2, int start, int end) {
-    SequenceI[] seqs = new Sequence[(seq2-seq1)+1];
-    for (int i=seq1; i<= seq2; i++ ) {
-      seqs[i] = new Sequence(getSequenceAt(i).getName(),
-                             getSequenceAt(i).getSequence().substring(start,end),
-                             getSequenceAt(i).findPosition(start),
-                             getSequenceAt(i).findPosition(end));
+    /**
+     * DOCUMENT ME!
+     *
+     * @param i DOCUMENT ME!
+     */
+    public void deleteSequence(int i)
+    {
+        sequences.removeElementAt(i);
     }
-    return seqs;
-  }
 
-  public void trimLeft(int i) {
-    for (int j = 0;j< getHeight();j++) {
+    /**
+     * DOCUMENT ME!
+     *
+     * @param threshold DOCUMENT ME!
+     * @param sel DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public Vector removeRedundancy(float threshold, Vector sel)
+    {
+        Vector del = new Vector();
 
-      SequenceI s        = getSequenceAt(j);
-      int       newstart = s.findPosition(i);
+        for (int i = 1; i < sel.size(); i++)
+        {
+            for (int j = 0; j < i; j++)
+            {
+                // Only do the comparison if either have not been deleted
+                if (!del.contains((SequenceI) sel.elementAt(i)) ||
+                        !del.contains((SequenceI) sel.elementAt(j)))
+                {
+                    // use PID instead of Comparison (which is really not pleasant)
+                    float pid = Comparison.PID((SequenceI) sel.elementAt(j),
+                            (SequenceI) sel.elementAt(i));
+
+                    if (pid >= threshold)
+                    {
+                        // Delete the shortest one
+                        if (((SequenceI) sel.elementAt(j)).getSequence().length() > ((SequenceI) sel
+                                                                                         .elementAt(
+                                    i)).getSequence().length())
+                        {
+                            del.addElement(sel.elementAt(i));
+                        }
+                        else
+                        {
+                            del.addElement(sel.elementAt(i));
+                        }
+                    }
+                }
+            }
+        }
 
-      s.setStart(newstart);
-      s.setSequence(s.getSequence().substring(i));
+        // Now delete the sequences
+        for (int i = 0; i < del.size(); i++)
+        {
+            deleteSequence((SequenceI) del.elementAt(i));
+        }
 
+        return del;
     }
-  }
-
-  public void  trimRight(int i) {
-    for (int j = 0;j< getHeight();j++) {
-      SequenceI s      = getSequenceAt(j);
-      int       newend = s.findPosition(i);
 
-      s.setEnd(newend);
-      s.setSequence(s.getSequence().substring(0,i+1));
+    /**    */
+    public SequenceGroup findGroup(int i)
+    {
+        return findGroup(getSequenceAt(i));
     }
-  }
-
-  public void deleteSequence(SequenceI s)
-  {
-    for (int i=0; i < getHeight(); i++)
-      if (getSequenceAt(i) == s)
-        deleteSequence(i);
-  }
-
-  public void  deleteSequence(int i)
-  {
-    sequences.removeElementAt(i);
-  }
 
-
-  public Vector removeRedundancy(float threshold, Vector sel) {
-    Vector del = new Vector();
-
-    for (int i = 1; i < sel.size(); i++)
+    /**    */
+    public SequenceGroup findGroup(SequenceI s)
     {
-      for (int j = 0; j < i; j++)
-      {
-        // Only do the comparison if either have not been deleted
-        if (!del.contains( (SequenceI) sel.elementAt(i)) ||
-            !del.contains( (SequenceI) sel.elementAt(j)))
+        for (int i = 0; i < this.groups.size(); i++)
         {
+            SequenceGroup sg = (SequenceGroup) groups.elementAt(i);
 
-          float pid = Comparison.compare( (SequenceI) sel.elementAt(j),
-                                         (SequenceI) sel.elementAt(i));
-
-          if (pid >= threshold)
-          {
-            // Delete the shortest one
-            if ( ( (SequenceI) sel.elementAt(j)).getSequence().length() >
-                ( (SequenceI) sel.elementAt(i)).getSequence().length())
-              del.addElement(sel.elementAt(i));
-            else
-              del.addElement(sel.elementAt(i));
-          }
+            if (sg.sequences.contains(s))
+            {
+                return sg;
+            }
         }
-      }
+
+        return null;
     }
 
-    // Now delete the sequences
-    for (int i=0; i < del.size(); i++)
-      deleteSequence((SequenceI)del.elementAt(i));
+    /**
+     * DOCUMENT ME!
+     *
+     * @param s DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public SequenceGroup[] findAllGroups(SequenceI s)
+    {
+        Vector temp = new Vector();
 
-    return del;
-  }
+        int gSize = groups.size();
+        for (int i = 0; i < gSize; i++)
+        {
+            SequenceGroup sg = (SequenceGroup) groups.elementAt(i);
+            if(sg==null || sg.sequences==null)
+            {
+              this.deleteGroup(sg);
+              gSize--;
+              continue;
+            }
+
+            if (sg.sequences.contains(s))
+            {
+                temp.addElement(sg);
+            }
+        }
 
-  public void sortByPID(SequenceI s) {
+        SequenceGroup[] ret = new SequenceGroup[temp.size()];
+
+        for (int i = 0; i < temp.size(); i++)
+        {
+            ret[i] = (SequenceGroup) temp.elementAt(i);
+        }
 
-    float     scores[] = new float[getHeight()];
-    SequenceI seqs[]   = new SequenceI[getHeight()];
+        return ret;
+    }
 
-    for (int i = 0; i < getHeight(); i++) {
-      scores[i] = Comparison.compare(getSequenceAt(i),s);
-      seqs[i]   = getSequenceAt(i);
+    /**
+     * DOCUMENT ME!
+     *
+     * @param sg DOCUMENT ME!
+     */
+    public void addSuperGroup(SuperGroup sg)
+    {
+        superGroup.addElement(sg);
     }
 
-    QuickSort.sort(scores,0,scores.length-1,seqs);
+    /**
+     * DOCUMENT ME!
+     *
+     * @param sg DOCUMENT ME!
+     */
+    public void removeSuperGroup(SuperGroup sg)
+    {
+        superGroup.removeElement(sg);
+    }
 
-    int len = 0;
+    /**
+     * DOCUMENT ME!
+     *
+     * @param sg DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public SuperGroup getSuperGroup(SequenceGroup sg)
+    {
+        for (int i = 0; i < this.superGroup.size(); i++)
+        {
+            SuperGroup temp = (SuperGroup) superGroup.elementAt(i);
 
-    if (getHeight()%2 == 0) {
-      len = getHeight()/2;
-    } else {
-      len = (getHeight()+1)/2;
-    }
+            if (temp.sequenceGroups.contains(sg))
+            {
+                return temp;
+            }
+        }
 
-    for (int i = 0; i < len; i++) {
-      SequenceI tmp = seqs[i];
-      sequences.setElementAt(seqs[getHeight()-i-1],i);
-      sequences.setElementAt(tmp,getHeight()-i-1);
+        return null;
     }
-  }
-
-  public void sortByID() {
-    String    ids[]   = new String[getHeight()];
-    SequenceI seqs[]  = new SequenceI[getHeight()];
 
-    for (int i = 0; i < getHeight(); i++) {
-      ids[i]  = getSequenceAt(i).getName();
-      seqs[i] = getSequenceAt(i);
+    /**    */
+    public void addGroup(SequenceGroup sg)
+    {
+        if (!groups.contains(sg))
+        {
+            groups.addElement(sg);
+        }
     }
 
-    QuickSort.sort(ids,seqs);
+    /**
+     * DOCUMENT ME!
+     */
+    public void deleteAllGroups()
+    {
+        groups.removeAllElements();
+        superGroup.removeAllElements();
 
-    int len = 0;
+        int i = 0;
 
-    if (getHeight()%2 == 0) {
-      len = getHeight()/2;
-    } else {
-      len = (getHeight()+1)/2;
-      System.out.println("Sort len is odd = " + len);
-    }
-    for (int i = 0; i < len; i++) {
-      System.out.println("Swapping " + seqs[i].getName() + " and " + seqs[getHeight()-i-1].getName());
-      SequenceI tmp = seqs[i];
-      sequences.setElementAt(seqs[getHeight()-i-1],i);
-      sequences.setElementAt(tmp,getHeight()-i-1);
+        while (i < sequences.size())
+        {
+            SequenceI s = getSequenceAt(i);
+            s.setColor(java.awt.Color.white);
+            i++;
+        }
     }
-  }
-
-  /**    */
-  public SequenceGroup findGroup(int i) {
-    return findGroup(getSequenceAt(i));
-  }
 
-  /**    */
-  public SequenceGroup findGroup(SequenceI s) {
-    for (int i = 0; i < this.groups.size();i++)
+    /**    */
+    public void deleteGroup(SequenceGroup g)
     {
-      SequenceGroup sg = (SequenceGroup)groups.elementAt(i);
-      if (sg.sequences.contains(s))
-        return sg;
-
+        if (groups.contains(g))
+        {
+            groups.removeElement(g);
+        }
     }
-    return null;
-  }
 
-  public SequenceGroup [] findAllGroups(SequenceI s)
-  {
+    /**    */
+    public SequenceI findName(String name)
+    {
+        int i = 0;
 
-    ArrayList temp = new ArrayList();
+        while (i < sequences.size())
+        {
+            if (getSequenceAt(i).getName().equals(name))
+            {
+                return getSequenceAt(i);
+            }
 
-    for (int i = 0; i < this.groups.size();i++)
-    {
-      SequenceGroup sg = (SequenceGroup)groups.elementAt(i);
+            i++;
+        }
 
-      if (sg.sequences.contains(s))
-       temp.add(sg);
+        return null;
     }
 
-    SequenceGroup [] ret = new SequenceGroup[temp.size()];
-    temp.toArray( ret );
 
-    return ret;
+    /**    */
+    public int findIndex(SequenceI s)
+    {
+        int i = 0;
 
-  }
-  /**    */
-  public void addToGroup(SequenceGroup g, SequenceI s) {
-    if (!(g.sequences.contains(s))) {
-      g.sequences.addElement(s);
-    }
-  }
-  /**    */
-  public void removeFromGroup(SequenceGroup g,SequenceI s) {
-    if (g != null && g.sequences != null) {
-      if (g.sequences.contains(s)) {
-        g.sequences.removeElement(s);
-        if (g.sequences.size() == 0) {
-          groups.removeElement(g);
-        }
-      }
-    }
-  }
+        while (i < sequences.size())
+        {
+            if (s == getSequenceAt(i))
+            {
+                return i;
+            }
 
-  public void addSuperGroup(SuperGroup sg)
-  {
-    superGroup.add(sg);
-  }
+            i++;
+        }
 
-  public void removeSuperGroup(SuperGroup sg)
-  {
-    superGroup.remove(sg);
-  }
+        return -1;
+    }
 
-  public SuperGroup     getSuperGroup(SequenceGroup sg)
-  {
-    for (int i = 0; i < this.superGroup.size(); i++)
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public int getHeight()
     {
-      SuperGroup temp = (SuperGroup) superGroup.get(i);
-      if (temp.sequenceGroups.contains(sg))
-        return temp;
+        return sequences.size();
     }
-    return null;
-  }
-
-  /**    */
-  public void addGroup(SequenceGroup sg) {
-    if(!groups.contains(sg))
-      groups.addElement(sg);
-  }
-
-  public void deleteAllGroups()
-  {
-    groups.clear();
-    superGroup.clear();
-   int i=0;
-    while (i < sequences.size()) {
-     SequenceI s = getSequenceAt(i);
-     s.setColor(java.awt.Color.white);
-     i++;
-   }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public int getWidth()
+    {
+        int maxLength = -1;
 
-  }
+        for (int i = 0; i < sequences.size(); i++)
+        {
+            if (getSequenceAt(i).getLength() > maxLength)
+            {
+                maxLength = getSequenceAt(i).getLength();
+            }
+        }
 
-  /**    */
-  public void deleteGroup(SequenceGroup g) {
-    if (groups.contains(g)) {
-      groups.removeElement(g);
+        return maxLength;
     }
-  }
 
-  /**    */
-  public SequenceI findName(String name) {
-    int i = 0;
-    while (i < sequences.size()) {
-      SequenceI s = getSequenceAt(i);
-      if (s.getName().equals(name))
-        return s;
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public int getMaxIdLength()
+    {
+        int max = 0;
+        int i = 0;
 
-      i++;
-    }
-    return null;
-  }
+        while (i < sequences.size())
+        {
+            SequenceI seq = getSequenceAt(i);
+            String tmp = seq.getName() + "/" + seq.getStart() + "-" +
+                seq.getEnd();
 
-  /**    */
-  public SequenceI findbyDisplayId(String name) {
-    int i = 0;
-    while (i < sequences.size()) {
-      SequenceI s = getSequenceAt(i);
-      if (s.getDisplayId().equals(name))
-        return s;
+            if (tmp.length() > max)
+            {
+                max = tmp.length();
+            }
 
-      i++;
+            i++;
+        }
+
+        return max;
     }
-    return null;
-  }
 
-  /**    */
-  public int findIndex(SequenceI s)
-  {
-    int i=0;
-    while (i < sequences.size())
+    /**
+     * DOCUMENT ME!
+     *
+     * @param gc DOCUMENT ME!
+     */
+    public void setGapCharacter(char gc)
     {
-      if (s == getSequenceAt(i))
-        return i;
+        gapCharacter = gc;
 
-      i++;
+        for (int i = 0; i < sequences.size(); i++)
+        {
+            Sequence seq = (Sequence) sequences.elementAt(i);
+            seq.sequence = seq.sequence.replace('.', gc);
+            seq.sequence = seq.sequence.replace('-', gc);
+            seq.sequence = seq.sequence.replace(' ', gc);
+        }
     }
-    return -1;
-  }
-
-  public int getHeight() {
-    return sequences.size();
-  }
 
-
-  public int getWidth()
-  {
-    int maxLength = -1;
-    for (int i = 0; i < sequences.size(); i++)
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public char getGapCharacter()
     {
-      if (getSequenceAt(i).getLength() > maxLength)
-        maxLength = getSequenceAt(i).getLength();
+        return gapCharacter;
     }
 
-    return maxLength;
-  }
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public Vector getAAFrequency()
+    {
+        return AAFrequency.calculate(sequences, 0, getWidth());
+    }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public boolean isAligned()
+    {
+        int width = getWidth();
 
-  public int getMaxIdLength() {
-    int max = 0;
-    int i   = 0;
+        for (int i = 0; i < sequences.size(); i++)
+        {
+            if (getSequenceAt(i).getLength() != width)
+            {
+                return false;
+            }
+        }
 
-    while (i < sequences.size()) {
-      SequenceI seq = getSequenceAt(i);
-      String    tmp = seq.getName() + "/" + seq.getStart() + "-" + seq.getEnd();
+        return true;
+    }
 
-      if (tmp.length() > max) {
-        max = tmp.length();
-      }
+    /**
+     * DOCUMENT ME!
+     *
+     * @param aa DOCUMENT ME!
+     */
+    public void deleteAnnotation(AlignmentAnnotation aa)
+    {
+        int aSize = 1;
 
-      i++;
-    }
-    return max;
-  }
-
-  public void setGapCharacter(char gc)
-  {
-    gapCharacter = gc;
-    for (int i=0; i < sequences.size(); i++)
-     {
-       Sequence seq = (Sequence)sequences.elementAt(i);
-       seq.sequence = seq.sequence.replace('.', gc);
-       seq.sequence = seq.sequence.replace('-', gc);
-     }
-  }
-
-  public char getGapCharacter() {
-    return gapCharacter;
-  }
-
-  public Vector getAAFrequency()
-  {
-    return AAFrequency.calculate(sequences, 0, getWidth());
-  }
-
-  public boolean isAligned()
-  {
-    int width = getWidth();
-    for (int i = 0; i < sequences.size(); i++)
-      if (getSequenceAt(i).getLength() != width)
-        return false;
+        if (annotations != null)
+        {
+            aSize = annotations.length;
+        }
 
-    return true;
-  }
+        AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize - 1];
 
-   public void deleteAnnotation(AlignmentAnnotation aa)
-   {
-     int aSize = 1;
-     if(annotations!=null)
-       aSize = annotations.length;
+        int tIndex = 0;
 
-     AlignmentAnnotation [] temp = new AlignmentAnnotation [aSize-1];
+        for (int i = 0; i < aSize; i++)
+        {
+            if (annotations[i] == aa)
+            {
+                continue;
+            }
 
-     int tIndex = 0;
-     for (int i = 0; i < aSize; i++)
-      {
-        if(annotations[i]==aa)
-          continue;
+            temp[tIndex] = annotations[i];
+            tIndex++;
+        }
 
+        annotations = temp;
+    }
 
-        temp[tIndex] = annotations[i];
-        tIndex++;
-      }
+    /**
+     * DOCUMENT ME!
+     *
+     * @param aa DOCUMENT ME!
+     */
+    public void addAnnotation(AlignmentAnnotation aa)
+    {
+        int aSize = 1;
 
-     annotations = temp;
+        if (annotations != null)
+        {
+            aSize = annotations.length + 1;
+        }
 
-   }
 
-  public void addAnnotation(AlignmentAnnotation aa)
-  {
-    int aSize = 1;
-    if(annotations!=null)
-      aSize = annotations.length+1;
+        AlignmentAnnotation[] temp = new AlignmentAnnotation[aSize];
+        int i = 0;
 
-    AlignmentAnnotation [] temp = new AlignmentAnnotation [aSize];
-    int i=0;
-    if (aSize > 1)
-      for (i = 0; i < aSize-1; i++)
-        temp[i] = annotations[i];
+        if (aSize > 1)
+        {
+            for (i = 0; i < (aSize - 1); i++)
+            {
+                temp[i] = annotations[i];
+            }
+        }
 
-    temp[i] = aa;
+        temp[i] = aa;
 
-    annotations = temp;
-  }
-  public AlignmentAnnotation[] getAlignmentAnnotation()
-  {
-    return annotations;
-  }
+        annotations = temp;
+    }
 
-}
+    /**
+     * DOCUMENT ME!
+     *
+     * @return DOCUMENT ME!
+     */
+    public AlignmentAnnotation[] getAlignmentAnnotation()
+    {
+        return annotations;
+    }
 
+    public void setNucleotide(boolean b)
+    {
+      if(b)
+        type = NUCLEOTIDE;
+      else
+        type = PROTEIN;
+    }
 
+    public boolean isNucleotide()
+    {
+      if(type==NUCLEOTIDE)
+        return true;
+      else
+        return false;
+    }
 
+    public void setDataset(Alignment data)
+    {
+      if(dataset==null && data==null)
+      {
+        // Create a new dataset for this alignment.
+        // Can only be done once, if dataset is not null
+        // This will not be performed
+        Sequence[] seqs = new Sequence[getHeight()];
+        for (int i = 0; i < getHeight(); i++)
+        {
 
+          seqs[i] = new Sequence(getSequenceAt(i).getDisplayId(true),
+                                 AlignSeq.extractGaps(
+                                     jalview.util.Comparison.GapChars,
+                                     getSequenceAt(i).getSequence()
+                                 ),
+                                 getSequenceAt(i).getStart(),
+                                 getSequenceAt(i).getEnd());
 
+          getSequenceAt(i).setDatasetSequence(seqs[i]);
+        }
 
+        dataset = new Alignment(seqs);
+      }
+      else if(dataset==null && data!=null)
+      {
+        dataset = data;
+      }
+    }
 
+    public Alignment getDataset()
+    {
+      return dataset;
+    }
 
+    public void setProvenance(Provenance prov)
+    {
+      provenance = prov;
+    }
+    public Provenance getProvenance()
+    {
+      return provenance;
+    }
+}