2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.datamodel;
23 import jalview.analysis.AlignSeq;
24 import jalview.api.DBRefEntryI;
25 import jalview.datamodel.features.SequenceFeatures;
26 import jalview.datamodel.features.SequenceFeaturesI;
27 import jalview.util.Comparison;
28 import jalview.util.DBRefUtils;
29 import jalview.util.MapList;
30 import jalview.util.StringUtils;
32 import java.util.ArrayList;
33 import java.util.Arrays;
34 import java.util.BitSet;
35 import java.util.Collections;
36 import java.util.Enumeration;
37 import java.util.List;
38 import java.util.ListIterator;
39 import java.util.Vector;
41 import fr.orsay.lri.varna.models.rna.RNA;
45 * Implements the SequenceI interface for a char[] based sequence object.
50 public class Sequence extends ASequence implements SequenceI
52 SequenceI datasetSequence;
56 private char[] sequence;
64 Vector<PDBEntry> pdbIds;
73 * This annotation is displayed below the alignment but the positions are tied
74 * to the residues of this sequence
76 * TODO: change to List<>
78 Vector<AlignmentAnnotation> annotation;
80 private SequenceFeaturesI sequenceFeatureStore;
83 * A cursor holding the approximate current view position to the sequence,
84 * as determined by findIndex or findPosition or findPositions.
85 * Using a cursor as a hint allows these methods to be more performant for
88 private SequenceCursor cursor;
91 * A number that should be incremented whenever the sequence is edited.
92 * If the value matches the cursor token, then we can trust the cursor,
93 * if not then it should be recomputed.
95 private int changeCount;
98 * Creates a new Sequence object.
101 * display name string
103 * string to form a possibly gapped sequence out of
105 * first position of non-gap residue in the sequence
107 * last position of ungapped residues (nearly always only used for
110 public Sequence(String name, String sequence, int start, int end)
113 initSeqAndName(name, sequence.toCharArray(), start, end);
116 public Sequence(String name, char[] sequence, int start, int end)
119 initSeqAndName(name, sequence, start, end);
123 * Stage 1 constructor - assign name, sequence, and set start and end fields.
124 * start and end are updated values from name2 if it ends with /start-end
131 protected void initSeqAndName(String name2, char[] sequence2, int start2,
135 this.sequence = sequence2;
143 * If 'name' ends in /i-j, where i >= j > 0 are integers, extracts i and j as
144 * start and end respectively and removes the suffix from the name
151 "POSSIBLE IMPLEMENTATION ERROR: null sequence name passed to constructor.");
154 int slashPos = name.lastIndexOf('/');
155 if (slashPos > -1 && slashPos < name.length() - 1)
157 String suffix = name.substring(slashPos + 1);
158 String[] range = suffix.split("-");
159 if (range.length == 2)
163 int from = Integer.valueOf(range[0]);
164 int to = Integer.valueOf(range[1]);
165 if (from > 0 && to >= from)
167 name = name.substring(0, slashPos);
172 } catch (NumberFormatException e)
174 // leave name unchanged if suffix is invalid
181 * Ensures that 'end' is not before the end of the sequence, that is,
182 * (end-start+1) is at least as long as the count of ungapped positions. Note
183 * that end is permitted to be beyond the end of the sequence data.
185 void checkValidRange()
188 // http://issues.jalview.org/browse/JAL-774?focusedCommentId=11239&page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel#comment-11239
191 for (int j = 0; j < sequence.length; j++)
193 if (!Comparison.isGap(sequence[j]))
212 * default constructor
216 sequenceFeatureStore = new SequenceFeatures();
220 * Creates a new Sequence object.
227 public Sequence(String name, String sequence)
229 this(name, sequence, 1, -1);
233 * Creates a new Sequence object with new AlignmentAnnotations but inherits
234 * any existing dataset sequence reference. If non exists, everything is
238 * if seq is a dataset sequence, behaves like a plain old copy
241 public Sequence(SequenceI seq)
243 this(seq, seq.getAnnotation());
247 * Create a new sequence object with new features, DBRefEntries, and PDBIds
248 * but inherits any existing dataset sequence reference, and duplicate of any
249 * annotation that is present in the given annotation array.
252 * the sequence to be copied
253 * @param alAnnotation
254 * an array of annotation including some associated with seq
256 public Sequence(SequenceI seq, AlignmentAnnotation[] alAnnotation)
259 initSeqFrom(seq, alAnnotation);
263 * does the heavy lifting when cloning a dataset sequence, or coping data from
264 * dataset to a new derived sequence.
267 * - source of attributes.
268 * @param alAnnotation
269 * - alignment annotation present on seq that should be copied onto
272 protected void initSeqFrom(SequenceI seq,
273 AlignmentAnnotation[] alAnnotation)
275 char[] oseq = seq.getSequence(); // returns a copy of the array
276 initSeqAndName(seq.getName(), oseq, seq.getStart(), seq.getEnd());
278 description = seq.getDescription();
279 if (seq != datasetSequence)
281 setDatasetSequence(seq.getDatasetSequence());
285 * only copy DBRefs and seqfeatures if we really are a dataset sequence
287 if (datasetSequence == null)
289 if (seq.getDBRefs() != null)
291 DBRefEntry[] dbr = seq.getDBRefs();
292 for (int i = 0; i < dbr.length; i++)
294 addDBRef(new DBRefEntry(dbr[i]));
299 * make copies of any sequence features
301 for (SequenceFeature sf : seq.getSequenceFeatures())
303 addSequenceFeature(new SequenceFeature(sf));
307 if (seq.getAnnotation() != null)
309 AlignmentAnnotation[] sqann = seq.getAnnotation();
310 for (int i = 0; i < sqann.length; i++)
312 if (sqann[i] == null)
316 boolean found = (alAnnotation == null);
319 for (int apos = 0; !found && apos < alAnnotation.length; apos++)
321 found = (alAnnotation[apos] == sqann[i]);
326 // only copy the given annotation
327 AlignmentAnnotation newann = new AlignmentAnnotation(sqann[i]);
328 addAlignmentAnnotation(newann);
332 if (seq.getAllPDBEntries() != null)
334 Vector<PDBEntry> ids = seq.getAllPDBEntries();
335 for (PDBEntry pdb : ids)
337 this.addPDBId(new PDBEntry(pdb));
343 public void setSequenceFeatures(List<SequenceFeature> features)
345 if (datasetSequence != null)
347 datasetSequence.setSequenceFeatures(features);
350 sequenceFeatureStore = new SequenceFeatures(features);
354 public synchronized boolean addSequenceFeature(SequenceFeature sf)
356 if (sf.getType() == null)
358 System.err.println("SequenceFeature type may not be null: "
363 if (datasetSequence != null)
365 return datasetSequence.addSequenceFeature(sf);
368 return sequenceFeatureStore.add(sf);
372 public void deleteFeature(SequenceFeature sf)
374 if (datasetSequence != null)
376 datasetSequence.deleteFeature(sf);
380 sequenceFeatureStore.delete(sf);
390 public List<SequenceFeature> getSequenceFeatures()
392 if (datasetSequence != null)
394 return datasetSequence.getSequenceFeatures();
396 return sequenceFeatureStore.getAllFeatures();
400 public SequenceFeaturesI getFeatures()
402 return datasetSequence != null ? datasetSequence.getFeatures()
403 : sequenceFeatureStore;
407 public boolean addPDBId(PDBEntry entry)
411 pdbIds = new Vector<PDBEntry>();
416 for (PDBEntry pdbe : pdbIds)
418 if (pdbe.updateFrom(entry))
423 pdbIds.addElement(entry);
434 public void setPDBId(Vector<PDBEntry> id)
442 * @return DOCUMENT ME!
445 public Vector<PDBEntry> getAllPDBEntries()
447 return pdbIds == null ? new Vector<PDBEntry>() : pdbIds;
453 * @return DOCUMENT ME!
456 public String getDisplayId(boolean jvsuffix)
458 StringBuffer result = new StringBuffer(name);
461 result.append("/" + start + "-" + end);
464 return result.toString();
468 * Sets the sequence name. If the name ends in /start-end, then the start-end
469 * values are parsed out and set, and the suffix is removed from the name.
474 public void setName(String theName)
483 * @return DOCUMENT ME!
486 public String getName()
498 public void setStart(int start)
506 * @return DOCUMENT ME!
509 public int getStart()
521 public void setEnd(int end)
529 * @return DOCUMENT ME!
540 * @return DOCUMENT ME!
543 public int getLength()
545 return this.sequence.length;
555 public void setSequence(String seq)
557 this.sequence = seq.toCharArray();
563 public String getSequenceAsString()
565 return new String(sequence);
569 public String getSequenceAsString(int start, int end)
571 return new String(getSequence(start, end));
575 public char[] getSequence()
578 return sequence == null ? null : Arrays.copyOf(sequence,
585 * @see jalview.datamodel.SequenceI#getSequence(int, int)
588 public char[] getSequence(int start, int end)
594 // JBPNote - left to user to pad the result here (TODO:Decide on this
596 if (start >= sequence.length)
601 if (end >= sequence.length)
603 end = sequence.length;
606 char[] reply = new char[end - start];
607 System.arraycopy(sequence, start, reply, 0, end - start);
613 public SequenceI getSubSequence(int start, int end)
619 char[] seq = getSequence(start, end);
624 int nstart = findPosition(start);
625 int nend = findPosition(end) - 1;
626 // JBPNote - this is an incomplete copy.
627 SequenceI nseq = new Sequence(this.getName(), seq, nstart, nend);
628 nseq.setDescription(description);
629 if (datasetSequence != null)
631 nseq.setDatasetSequence(datasetSequence);
635 nseq.setDatasetSequence(this);
641 * Returns the character of the aligned sequence at the given position (base
642 * zero), or space if the position is not within the sequence's bounds
647 public char getCharAt(int i)
649 if (i >= 0 && i < sequence.length)
660 * Sets the sequence description, and also parses out any special formats of
666 public void setDescription(String desc)
668 this.description = desc;
672 public void setGeneLoci(String speciesId, String assemblyId,
673 String chromosomeId, MapList map)
675 addDBRef(new DBRefEntry(speciesId, assemblyId, DBRefEntry.CHROMOSOME
676 + ":" + chromosomeId, new Mapping(map)));
680 * Returns the gene loci mapping for the sequence (may be null)
685 public GeneLociI getGeneLoci()
687 DBRefEntry[] refs = getDBRefs();
690 for (final DBRefEntry ref : refs)
692 if (ref.isChromosome())
694 return new GeneLociI()
697 public String getSpeciesId()
699 return ref.getSource();
703 public String getAssemblyId()
705 return ref.getVersion();
709 public String getChromosomeId()
711 // strip off "chromosome:" prefix to chrId
712 return ref.getAccessionId().substring(
713 DBRefEntry.CHROMOSOME.length() + 1);
717 public MapList getMap()
719 return ref.getMap().getMap();
729 * Answers the description
734 public String getDescription()
736 return this.description;
743 public int findIndex(int pos)
746 * use a valid, hopefully nearby, cursor if available
748 if (isValidCursor(cursor))
750 return findIndex(pos, cursor);
758 * traverse sequence from the start counting gaps; make a note of
759 * the column of the first residue to save in the cursor
761 while ((i < sequence.length) && (j <= end) && (j <= pos))
763 if (!Comparison.isGap(sequence[i]))
774 if (j == end && j < pos)
779 updateCursor(pos, i, startColumn);
784 * Updates the cursor to the latest found residue and column position
791 * column position of the first sequence residue
793 protected void updateCursor(int residuePos, int column, int startColumn)
796 * preserve end residue column provided cursor was valid
798 int endColumn = isValidCursor(cursor) ? cursor.lastColumnPosition : 0;
799 if (residuePos == this.end)
804 cursor = new SequenceCursor(this, residuePos, column, startColumn,
805 endColumn, this.changeCount);
809 * Answers the aligned column position (1..) for the given residue position
810 * (start..) given a 'hint' of a residue/column location in the neighbourhood.
811 * The hint may be left of, at, or to the right of the required position.
817 protected int findIndex(int pos, SequenceCursor curs)
819 if (!isValidCursor(curs))
822 * wrong or invalidated cursor, compute de novo
824 return findIndex(pos);
827 if (curs.residuePosition == pos)
829 return curs.columnPosition;
833 * move left or right to find pos from hint.position
835 int col = curs.columnPosition - 1; // convert from base 1 to 0-based array
837 int newPos = curs.residuePosition;
838 int delta = newPos > pos ? -1 : 1;
840 while (newPos != pos)
842 col += delta; // shift one column left or right
843 if (col < 0 || col == sequence.length)
847 if (!Comparison.isGap(sequence[col]))
853 col++; // convert back to base 1
854 updateCursor(pos, col, curs.firstColumnPosition);
863 public int findPosition(final int column)
866 * use a valid, hopefully nearby, cursor if available
868 if (isValidCursor(cursor))
870 return findPosition(column + 1, cursor);
873 // TODO recode this more naturally i.e. count residues only
874 // as they are found, not 'in anticipation'
877 * traverse the sequence counting gaps; note the column position
878 * of the first residue, to save in the cursor
880 int firstResidueColumn = 0;
881 int lastPosFound = 0;
882 int lastPosFoundColumn = 0;
883 int seqlen = sequence.length;
885 if (seqlen > 0 && !Comparison.isGap(sequence[0]))
887 lastPosFound = start;
888 lastPosFoundColumn = 0;
894 while (j < column && j < seqlen)
896 if (!Comparison.isGap(sequence[j]))
899 lastPosFoundColumn = j;
900 if (pos == this.start)
902 firstResidueColumn = j;
908 if (j < seqlen && !Comparison.isGap(sequence[j]))
911 lastPosFoundColumn = j;
912 if (pos == this.start)
914 firstResidueColumn = j;
919 * update the cursor to the last residue position found (if any)
920 * (converting column position to base 1)
922 if (lastPosFound != 0)
924 updateCursor(lastPosFound, lastPosFoundColumn + 1,
925 firstResidueColumn + 1);
932 * Answers true if the given cursor is not null, is for this sequence object,
933 * and has a token value that matches this object's changeCount, else false.
934 * This allows us to ignore a cursor as 'stale' if the sequence has been
935 * modified since the cursor was created.
940 protected boolean isValidCursor(SequenceCursor curs)
942 if (curs == null || curs.sequence != this || curs.token != changeCount)
947 * sanity check against range
949 if (curs.columnPosition < 0 || curs.columnPosition > sequence.length)
953 if (curs.residuePosition < start || curs.residuePosition > end)
961 * Answers the sequence position (start..) for the given aligned column
962 * position (1..), given a hint of a cursor in the neighbourhood. The cursor
963 * may lie left of, at, or to the right of the column position.
969 protected int findPosition(final int col, SequenceCursor curs)
971 if (!isValidCursor(curs))
974 * wrong or invalidated cursor, compute de novo
976 return findPosition(col - 1);// ugh back to base 0
979 if (curs.columnPosition == col)
981 cursor = curs; // in case this method becomes public
982 return curs.residuePosition; // easy case :-)
985 if (curs.lastColumnPosition > 0 && curs.lastColumnPosition < col)
988 * sequence lies entirely to the left of col
989 * - return last residue + 1
994 if (curs.firstColumnPosition > 0 && curs.firstColumnPosition > col)
997 * sequence lies entirely to the right of col
998 * - return first residue
1003 // todo could choose closest to col out of column,
1004 // firstColumnPosition, lastColumnPosition as a start point
1007 * move left or right to find pos from cursor position
1009 int firstResidueColumn = curs.firstColumnPosition;
1010 int column = curs.columnPosition - 1; // to base 0
1011 int newPos = curs.residuePosition;
1012 int delta = curs.columnPosition > col ? -1 : 1;
1013 boolean gapped = false;
1014 int lastFoundPosition = curs.residuePosition;
1015 int lastFoundPositionColumn = curs.columnPosition;
1017 while (column != col - 1)
1019 column += delta; // shift one column left or right
1020 if (column < 0 || column == sequence.length)
1024 gapped = Comparison.isGap(sequence[column]);
1028 lastFoundPosition = newPos;
1029 lastFoundPositionColumn = column + 1;
1030 if (lastFoundPosition == this.start)
1032 firstResidueColumn = column + 1;
1037 if (cursor == null || lastFoundPosition != cursor.residuePosition)
1039 updateCursor(lastFoundPosition, lastFoundPositionColumn,
1040 firstResidueColumn);
1044 * hack to give position to the right if on a gap
1045 * or beyond the length of the sequence (see JAL-2562)
1047 if (delta > 0 && (gapped || column >= sequence.length))
1059 public Range findPositions(int fromColumn, int toColumn)
1061 if (toColumn < fromColumn || fromColumn < 1)
1067 * find the first non-gapped position, if any
1069 int firstPosition = 0;
1070 int col = fromColumn - 1;
1071 int length = sequence.length;
1072 while (col < length && col < toColumn)
1074 if (!Comparison.isGap(sequence[col]))
1076 firstPosition = findPosition(col++);
1082 if (firstPosition == 0)
1088 * find the last non-gapped position
1090 int lastPosition = firstPosition;
1091 while (col < length && col < toColumn)
1093 if (!Comparison.isGap(sequence[col++]))
1099 return new Range(firstPosition, lastPosition);
1103 * Returns an int array where indices correspond to each residue in the
1104 * sequence and the element value gives its position in the alignment
1106 * @return int[SequenceI.getEnd()-SequenceI.getStart()+1] or null if no
1107 * residues in SequenceI object
1110 public int[] gapMap()
1112 String seq = jalview.analysis.AlignSeq.extractGaps(
1113 jalview.util.Comparison.GapChars, new String(sequence));
1114 int[] map = new int[seq.length()];
1118 while (j < sequence.length)
1120 if (!jalview.util.Comparison.isGap(sequence[j]))
1132 public int[] findPositionMap()
1134 int map[] = new int[sequence.length];
1137 int seqlen = sequence.length;
1138 while ((j < seqlen))
1141 if (!jalview.util.Comparison.isGap(sequence[j]))
1152 public List<int[]> getInsertions()
1154 ArrayList<int[]> map = new ArrayList<int[]>();
1155 int lastj = -1, j = 0;
1157 int seqlen = sequence.length;
1158 while ((j < seqlen))
1160 if (jalview.util.Comparison.isGap(sequence[j]))
1171 map.add(new int[] { lastj, j - 1 });
1179 map.add(new int[] { lastj, j - 1 });
1186 public BitSet getInsertionsAsBits()
1188 BitSet map = new BitSet();
1189 int lastj = -1, j = 0;
1191 int seqlen = sequence.length;
1192 while ((j < seqlen))
1194 if (jalview.util.Comparison.isGap(sequence[j]))
1220 public void deleteChars(int i, int j)
1222 int newstart = start, newend = end;
1223 if (i >= sequence.length || i < 0)
1228 char[] tmp = StringUtils.deleteChars(sequence, i, j);
1229 boolean createNewDs = false;
1230 // TODO: take a (second look) at the dataset creation validation method for
1231 // the very large sequence case
1232 int eindex = -1, sindex = -1;
1233 boolean ecalc = false, scalc = false;
1234 for (int s = i; s < j; s++)
1236 if (jalview.schemes.ResidueProperties.aaIndex[sequence[s]] != 23)
1246 sindex = findIndex(start) - 1;
1251 // delete characters including start of sequence
1252 newstart = findPosition(j);
1253 break; // don't need to search for any more residue characters.
1257 // delete characters after start.
1260 eindex = findIndex(end) - 1;
1265 // delete characters at end of sequence
1266 newend = findPosition(i - 1);
1267 break; // don't need to search for any more residue characters.
1272 newend--; // decrease end position by one for the deleted residue
1273 // and search further
1279 // deletion occured in the middle of the sequence
1280 if (createNewDs && this.datasetSequence != null)
1282 // construct a new sequence
1283 Sequence ds = new Sequence(datasetSequence);
1284 // TODO: remove any non-inheritable properties ?
1285 // TODO: create a sequence mapping (since there is a relation here ?)
1286 ds.deleteChars(i, j);
1287 datasetSequence = ds;
1296 public void insertCharAt(int i, int length, char c)
1298 char[] tmp = new char[sequence.length + length];
1300 if (i >= sequence.length)
1302 System.arraycopy(sequence, 0, tmp, 0, sequence.length);
1303 i = sequence.length;
1307 System.arraycopy(sequence, 0, tmp, 0, i);
1317 if (i < sequence.length)
1319 System.arraycopy(sequence, i, tmp, index, sequence.length - i);
1327 public void insertCharAt(int i, char c)
1329 insertCharAt(i, 1, c);
1333 public String getVamsasId()
1339 public void setVamsasId(String id)
1345 public void setDBRefs(DBRefEntry[] dbref)
1347 if (dbrefs == null && datasetSequence != null
1348 && this != datasetSequence)
1350 datasetSequence.setDBRefs(dbref);
1356 DBRefUtils.ensurePrimaries(this);
1361 public DBRefEntry[] getDBRefs()
1363 if (dbrefs == null && datasetSequence != null
1364 && this != datasetSequence)
1366 return datasetSequence.getDBRefs();
1372 public void addDBRef(DBRefEntry entry)
1374 if (datasetSequence != null)
1376 datasetSequence.addDBRef(entry);
1382 dbrefs = new DBRefEntry[0];
1385 for (DBRefEntryI dbr : dbrefs)
1387 if (dbr.updateFrom(entry))
1390 * found a dbref that either matched, or could be
1391 * updated from, the new entry - no need to add it
1398 * extend the array to make room for one more
1400 // TODO use an ArrayList instead
1401 int j = dbrefs.length;
1402 DBRefEntry[] temp = new DBRefEntry[j + 1];
1403 System.arraycopy(dbrefs, 0, temp, 0, j);
1404 temp[temp.length - 1] = entry;
1408 DBRefUtils.ensurePrimaries(this);
1412 public void setDatasetSequence(SequenceI seq)
1416 throw new IllegalArgumentException(
1417 "Implementation Error: self reference passed to SequenceI.setDatasetSequence");
1419 if (seq != null && seq.getDatasetSequence() != null)
1421 throw new IllegalArgumentException(
1422 "Implementation error: cascading dataset sequences are not allowed.");
1424 datasetSequence = seq;
1428 public SequenceI getDatasetSequence()
1430 return datasetSequence;
1434 public AlignmentAnnotation[] getAnnotation()
1436 return annotation == null ? null
1438 .toArray(new AlignmentAnnotation[annotation.size()]);
1442 public boolean hasAnnotation(AlignmentAnnotation ann)
1444 return annotation == null ? false : annotation.contains(ann);
1448 public void addAlignmentAnnotation(AlignmentAnnotation annotation)
1450 if (this.annotation == null)
1452 this.annotation = new Vector<AlignmentAnnotation>();
1454 if (!this.annotation.contains(annotation))
1456 this.annotation.addElement(annotation);
1458 annotation.setSequenceRef(this);
1462 public void removeAlignmentAnnotation(AlignmentAnnotation annotation)
1464 if (this.annotation != null)
1466 this.annotation.removeElement(annotation);
1467 if (this.annotation.size() == 0)
1469 this.annotation = null;
1475 * test if this is a valid candidate for another sequence's dataset sequence.
1478 private boolean isValidDatasetSequence()
1480 if (datasetSequence != null)
1484 for (int i = 0; i < sequence.length; i++)
1486 if (jalview.util.Comparison.isGap(sequence[i]))
1495 public SequenceI deriveSequence()
1497 Sequence seq = null;
1498 if (datasetSequence == null)
1500 if (isValidDatasetSequence())
1502 // Use this as dataset sequence
1503 seq = new Sequence(getName(), "", 1, -1);
1504 seq.setDatasetSequence(this);
1505 seq.initSeqFrom(this, getAnnotation());
1510 // Create a new, valid dataset sequence
1511 createDatasetSequence();
1514 return new Sequence(this);
1517 private boolean _isNa;
1519 private int _seqhash = 0;
1522 * Answers false if the sequence is more than 85% nucleotide (ACGTU), else
1526 public boolean isProtein()
1528 if (datasetSequence != null)
1530 return datasetSequence.isProtein();
1532 if (_seqhash != sequence.hashCode())
1534 _seqhash = sequence.hashCode();
1535 _isNa = Comparison.isNucleotide(this);
1543 * @see jalview.datamodel.SequenceI#createDatasetSequence()
1546 public SequenceI createDatasetSequence()
1548 if (datasetSequence == null)
1550 Sequence dsseq = new Sequence(getName(),
1551 AlignSeq.extractGaps(jalview.util.Comparison.GapChars,
1552 getSequenceAsString()),
1553 getStart(), getEnd());
1555 datasetSequence = dsseq;
1557 dsseq.setDescription(description);
1558 // move features and database references onto dataset sequence
1559 dsseq.sequenceFeatureStore = sequenceFeatureStore;
1560 sequenceFeatureStore = null;
1561 dsseq.dbrefs = dbrefs;
1563 // TODO: search and replace any references to this sequence with
1564 // references to the dataset sequence in Mappings on dbref
1565 dsseq.pdbIds = pdbIds;
1567 datasetSequence.updatePDBIds();
1568 if (annotation != null)
1570 // annotation is cloned rather than moved, to preserve what's currently
1572 for (AlignmentAnnotation aa : annotation)
1574 AlignmentAnnotation _aa = new AlignmentAnnotation(aa);
1575 _aa.sequenceRef = datasetSequence;
1576 _aa.adjustForAlignment(); // uses annotation's own record of
1577 // sequence-column mapping
1578 datasetSequence.addAlignmentAnnotation(_aa);
1582 return datasetSequence;
1589 * jalview.datamodel.SequenceI#setAlignmentAnnotation(AlignmmentAnnotation[]
1593 public void setAlignmentAnnotation(AlignmentAnnotation[] annotations)
1595 if (annotation != null)
1597 annotation.removeAllElements();
1599 if (annotations != null)
1601 for (int i = 0; i < annotations.length; i++)
1603 if (annotations[i] != null)
1605 addAlignmentAnnotation(annotations[i]);
1612 public AlignmentAnnotation[] getAnnotation(String label)
1614 if (annotation == null || annotation.size() == 0)
1619 Vector<AlignmentAnnotation> subset = new Vector<AlignmentAnnotation>();
1620 Enumeration<AlignmentAnnotation> e = annotation.elements();
1621 while (e.hasMoreElements())
1623 AlignmentAnnotation ann = e.nextElement();
1624 if (ann.label != null && ann.label.equals(label))
1626 subset.addElement(ann);
1629 if (subset.size() == 0)
1633 AlignmentAnnotation[] anns = new AlignmentAnnotation[subset.size()];
1635 e = subset.elements();
1636 while (e.hasMoreElements())
1638 anns[i++] = e.nextElement();
1640 subset.removeAllElements();
1645 public boolean updatePDBIds()
1647 if (datasetSequence != null)
1649 // TODO: could merge DBRefs
1650 return datasetSequence.updatePDBIds();
1652 if (dbrefs == null || dbrefs.length == 0)
1656 boolean added = false;
1657 for (DBRefEntry dbr : dbrefs)
1659 if (DBRefSource.PDB.equals(dbr.getSource()))
1662 * 'Add' any PDB dbrefs as a PDBEntry - add is only performed if the
1663 * PDB id is not already present in a 'matching' PDBEntry
1664 * Constructor parses out a chain code if appended to the accession id
1665 * (a fudge used to 'store' the chain code in the DBRef)
1667 PDBEntry pdbe = new PDBEntry(dbr);
1668 added |= addPDBId(pdbe);
1675 public void transferAnnotation(SequenceI entry, Mapping mp)
1677 if (datasetSequence != null)
1679 datasetSequence.transferAnnotation(entry, mp);
1682 if (entry.getDatasetSequence() != null)
1684 transferAnnotation(entry.getDatasetSequence(), mp);
1687 // transfer any new features from entry onto sequence
1688 if (entry.getSequenceFeatures() != null)
1691 List<SequenceFeature> sfs = entry.getSequenceFeatures();
1692 for (SequenceFeature feature : sfs)
1694 SequenceFeature sf[] = (mp != null) ? mp.locateFeature(feature)
1695 : new SequenceFeature[] { new SequenceFeature(feature) };
1698 for (int sfi = 0; sfi < sf.length; sfi++)
1700 addSequenceFeature(sf[sfi]);
1706 // transfer PDB entries
1707 if (entry.getAllPDBEntries() != null)
1709 Enumeration<PDBEntry> e = entry.getAllPDBEntries().elements();
1710 while (e.hasMoreElements())
1712 PDBEntry pdb = e.nextElement();
1716 // transfer database references
1717 DBRefEntry[] entryRefs = entry.getDBRefs();
1718 if (entryRefs != null)
1720 for (int r = 0; r < entryRefs.length; r++)
1722 DBRefEntry newref = new DBRefEntry(entryRefs[r]);
1723 if (newref.getMap() != null && mp != null)
1725 // remap ref using our local mapping
1727 // we also assume all version string setting is done by dbSourceProxy
1729 * if (!newref.getSource().equalsIgnoreCase(dbSource)) {
1730 * newref.setSource(dbSource); }
1738 public void setRNA(RNA r)
1750 public List<AlignmentAnnotation> getAlignmentAnnotations(String calcId,
1753 List<AlignmentAnnotation> result = new ArrayList<AlignmentAnnotation>();
1754 if (this.annotation != null)
1756 for (AlignmentAnnotation ann : annotation)
1758 if (ann.calcId != null && ann.calcId.equals(calcId)
1759 && ann.label != null && ann.label.equals(label))
1769 public String toString()
1771 return getDisplayId(false);
1775 public PDBEntry getPDBEntry(String pdbIdStr)
1777 if (getDatasetSequence() != null)
1779 return getDatasetSequence().getPDBEntry(pdbIdStr);
1785 List<PDBEntry> entries = getAllPDBEntries();
1786 for (PDBEntry entry : entries)
1788 if (entry.getId().equalsIgnoreCase(pdbIdStr))
1797 public List<DBRefEntry> getPrimaryDBRefs()
1799 if (datasetSequence != null)
1801 return datasetSequence.getPrimaryDBRefs();
1803 if (dbrefs == null || dbrefs.length == 0)
1805 return Collections.emptyList();
1807 synchronized (dbrefs)
1809 List<DBRefEntry> primaries = new ArrayList<DBRefEntry>();
1810 DBRefEntry[] tmp = new DBRefEntry[1];
1811 for (DBRefEntry ref : dbrefs)
1813 if (!ref.isPrimaryCandidate())
1819 MapList mp = ref.getMap().getMap();
1820 if (mp.getFromLowest() > start || mp.getFromHighest() < end)
1822 // map only involves a subsequence, so cannot be primary
1826 // whilst it looks like it is a primary ref, we also sanity check type
1827 if (DBRefUtils.getCanonicalName(DBRefSource.PDB)
1828 .equals(DBRefUtils.getCanonicalName(ref.getSource())))
1830 // PDB dbrefs imply there should be a PDBEntry associated
1831 // TODO: tighten PDB dbrefs
1832 // formally imply Jalview has actually downloaded and
1833 // parsed the pdb file. That means there should be a cached file
1834 // handle on the PDBEntry, and a real mapping between sequence and
1835 // extracted sequence from PDB file
1836 PDBEntry pdbentry = getPDBEntry(ref.getAccessionId());
1837 if (pdbentry != null && pdbentry.getFile() != null)
1843 // check standard protein or dna sources
1845 DBRefEntry[] res = DBRefUtils.selectDbRefs(!isProtein(), tmp);
1846 if (res != null && res[0] == tmp[0])
1860 public List<SequenceFeature> findFeatures(int fromColumn, int toColumn,
1863 int startPos = findPosition(fromColumn - 1); // convert base 1 to base 0
1864 int endPos = fromColumn == toColumn ? startPos
1865 : findPosition(toColumn - 1);
1867 List<SequenceFeature> result = getFeatures().findFeatures(startPos,
1871 * if end column is gapped, endPos may be to the right,
1872 * and we may have included adjacent or enclosing features;
1873 * remove any that are not enclosing, non-contact features
1875 boolean endColumnIsGapped = toColumn > 0 && toColumn <= sequence.length
1876 && Comparison.isGap(sequence[toColumn - 1]);
1877 if (endPos > this.end || endColumnIsGapped)
1879 ListIterator<SequenceFeature> it = result.listIterator();
1880 while (it.hasNext())
1882 SequenceFeature sf = it.next();
1883 int sfBegin = sf.getBegin();
1884 int sfEnd = sf.getEnd();
1885 int featureStartColumn = findIndex(sfBegin);
1886 if (featureStartColumn > toColumn)
1890 else if (featureStartColumn < fromColumn)
1892 int featureEndColumn = sfEnd == sfBegin ? featureStartColumn
1894 if (featureEndColumn < fromColumn)
1898 else if (featureEndColumn > toColumn && sf.isContactFeature())
1901 * remove an enclosing feature if it is a contact feature
1913 * Invalidates any stale cursors (forcing recalculation) by incrementing the
1914 * token that has to match the one presented by the cursor
1917 public void sequenceChanged()
1926 public int replace(char c1, char c2)
1933 synchronized (sequence)
1935 for (int c = 0; c < sequence.length; c++)
1937 if (sequence[c] == c1)