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 com.stevesoft.pat.Regex;
43 import fr.orsay.lri.varna.models.rna.RNA;
47 * Implements the SequenceI interface for a char[] based sequence object
49 public class Sequence extends ASequence implements SequenceI
51 private static final Regex limitrx = new Regex(
52 "[/][0-9]{1,}[-][0-9]{1,}$");
54 private static final Regex endrx = new Regex("[0-9]{1,}$");
56 SequenceI datasetSequence;
60 private char[] sequence;
68 Vector<PDBEntry> pdbIds;
77 * This annotation is displayed below the alignment but the positions are tied
78 * to the residues of this sequence
80 * TODO: change to List<>
82 Vector<AlignmentAnnotation> annotation;
85 * The index of the sequence in a MSA
89 private SequenceFeatures sequenceFeatureStore;
92 * A cursor holding the approximate current view position to the sequence,
93 * as determined by findIndex or findPosition or findPositions.
94 * Using a cursor as a hint allows these methods to be more performant for
97 private SequenceCursor cursor;
100 * A number that should be incremented whenever the sequence is edited.
101 * If the value matches the cursor token, then we can trust the cursor,
102 * if not then it should be recomputed.
104 private int changeCount;
107 * Creates a new Sequence object.
110 * display name string
112 * string to form a possibly gapped sequence out of
114 * first position of non-gap residue in the sequence
116 * last position of ungapped residues (nearly always only used for
119 public Sequence(String name, String sequence, int start, int end)
122 initSeqAndName(name, sequence.toCharArray(), start, end);
125 public Sequence(String name, char[] sequence, int start, int end)
128 initSeqAndName(name, sequence, start, end);
132 * Stage 1 constructor - assign name, sequence, and set start and end fields.
133 * start and end are updated values from name2 if it ends with /start-end
140 protected void initSeqAndName(String name2, char[] sequence2, int start2,
144 this.sequence = sequence2;
156 "POSSIBLE IMPLEMENTATION ERROR: null sequence name passed to constructor.");
159 // Does sequence have the /start-end signature?
160 if (limitrx.search(name))
162 name = limitrx.left();
163 endrx.search(limitrx.stringMatched());
164 setStart(Integer.parseInt(limitrx.stringMatched().substring(1,
165 endrx.matchedFrom() - 1)));
166 setEnd(Integer.parseInt(endrx.stringMatched()));
170 void checkValidRange()
173 // http://issues.jalview.org/browse/JAL-774?focusedCommentId=11239&page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel#comment-11239
176 for (int j = 0; j < sequence.length; j++)
178 if (!jalview.util.Comparison.isGap(sequence[j]))
197 * default constructor
201 sequenceFeatureStore = new SequenceFeatures();
205 * Creates a new Sequence object.
212 public Sequence(String name, String sequence)
214 this(name, sequence, 1, -1);
218 * Creates a new Sequence object with new AlignmentAnnotations but inherits
219 * any existing dataset sequence reference. If non exists, everything is
223 * if seq is a dataset sequence, behaves like a plain old copy
226 public Sequence(SequenceI seq)
228 this(seq, seq.getAnnotation());
232 * Create a new sequence object with new features, DBRefEntries, and PDBIds
233 * but inherits any existing dataset sequence reference, and duplicate of any
234 * annotation that is present in the given annotation array.
237 * the sequence to be copied
238 * @param alAnnotation
239 * an array of annotation including some associated with seq
241 public Sequence(SequenceI seq, AlignmentAnnotation[] alAnnotation)
244 initSeqFrom(seq, alAnnotation);
248 * does the heavy lifting when cloning a dataset sequence, or coping data from
249 * dataset to a new derived sequence.
252 * - source of attributes.
253 * @param alAnnotation
254 * - alignment annotation present on seq that should be copied onto
257 protected void initSeqFrom(SequenceI seq,
258 AlignmentAnnotation[] alAnnotation)
260 char[] oseq = seq.getSequence(); // returns a copy of the array
261 initSeqAndName(seq.getName(), oseq, seq.getStart(), seq.getEnd());
263 description = seq.getDescription();
264 if (seq != datasetSequence)
266 setDatasetSequence(seq.getDatasetSequence());
270 * only copy DBRefs and seqfeatures if we really are a dataset sequence
272 if (datasetSequence == null)
274 if (seq.getDBRefs() != null)
276 DBRefEntry[] dbr = seq.getDBRefs();
277 for (int i = 0; i < dbr.length; i++)
279 addDBRef(new DBRefEntry(dbr[i]));
284 * make copies of any sequence features
286 for (SequenceFeature sf : seq.getSequenceFeatures())
288 addSequenceFeature(new SequenceFeature(sf));
292 if (seq.getAnnotation() != null)
294 AlignmentAnnotation[] sqann = seq.getAnnotation();
295 for (int i = 0; i < sqann.length; i++)
297 if (sqann[i] == null)
301 boolean found = (alAnnotation == null);
304 for (int apos = 0; !found && apos < alAnnotation.length; apos++)
306 found = (alAnnotation[apos] == sqann[i]);
311 // only copy the given annotation
312 AlignmentAnnotation newann = new AlignmentAnnotation(sqann[i]);
313 addAlignmentAnnotation(newann);
317 if (seq.getAllPDBEntries() != null)
319 Vector<PDBEntry> ids = seq.getAllPDBEntries();
320 for (PDBEntry pdb : ids)
322 this.addPDBId(new PDBEntry(pdb));
328 public void setSequenceFeatures(List<SequenceFeature> features)
330 if (datasetSequence != null)
332 datasetSequence.setSequenceFeatures(features);
335 sequenceFeatureStore = new SequenceFeatures(features);
339 public synchronized boolean addSequenceFeature(SequenceFeature sf)
341 if (sf.getType() == null)
343 System.err.println("SequenceFeature type may not be null: "
348 if (datasetSequence != null)
350 return datasetSequence.addSequenceFeature(sf);
353 return sequenceFeatureStore.add(sf);
357 public void deleteFeature(SequenceFeature sf)
359 if (datasetSequence != null)
361 datasetSequence.deleteFeature(sf);
365 sequenceFeatureStore.delete(sf);
375 public List<SequenceFeature> getSequenceFeatures()
377 if (datasetSequence != null)
379 return datasetSequence.getSequenceFeatures();
381 return sequenceFeatureStore.getAllFeatures();
385 public SequenceFeaturesI getFeatures()
387 return datasetSequence != null ? datasetSequence.getFeatures()
388 : sequenceFeatureStore;
392 public boolean addPDBId(PDBEntry entry)
396 pdbIds = new Vector<PDBEntry>();
401 for (PDBEntry pdbe : pdbIds)
403 if (pdbe.updateFrom(entry))
408 pdbIds.addElement(entry);
419 public void setPDBId(Vector<PDBEntry> id)
427 * @return DOCUMENT ME!
430 public Vector<PDBEntry> getAllPDBEntries()
432 return pdbIds == null ? new Vector<PDBEntry>() : pdbIds;
438 * @return DOCUMENT ME!
441 public String getDisplayId(boolean jvsuffix)
443 StringBuffer result = new StringBuffer(name);
446 result.append("/" + start + "-" + end);
449 return result.toString();
459 public void setName(String name)
468 * @return DOCUMENT ME!
471 public String getName()
483 public void setStart(int start)
491 * @return DOCUMENT ME!
494 public int getStart()
506 public void setEnd(int end)
514 * @return DOCUMENT ME!
525 * @return DOCUMENT ME!
528 public int getLength()
530 return this.sequence.length;
540 public void setSequence(String seq)
542 this.sequence = seq.toCharArray();
548 public String getSequenceAsString()
550 return new String(sequence);
554 public String getSequenceAsString(int start, int end)
556 return new String(getSequence(start, end));
560 public char[] getSequence()
563 return sequence == null ? null : Arrays.copyOf(sequence,
570 * @see jalview.datamodel.SequenceI#getSequence(int, int)
573 public char[] getSequence(int start, int end)
579 // JBPNote - left to user to pad the result here (TODO:Decide on this
581 if (start >= sequence.length)
586 if (end >= sequence.length)
588 end = sequence.length;
591 char[] reply = new char[end - start];
592 System.arraycopy(sequence, start, reply, 0, end - start);
598 public SequenceI getSubSequence(int start, int end)
604 char[] seq = getSequence(start, end);
609 int nstart = findPosition(start);
610 int nend = findPosition(end) - 1;
611 // JBPNote - this is an incomplete copy.
612 SequenceI nseq = new Sequence(this.getName(), seq, nstart, nend);
613 nseq.setDescription(description);
614 if (datasetSequence != null)
616 nseq.setDatasetSequence(datasetSequence);
620 nseq.setDatasetSequence(this);
626 * Returns the character of the aligned sequence at the given position (base
627 * zero), or space if the position is not within the sequence's bounds
632 public char getCharAt(int i)
634 if (i >= 0 && i < sequence.length)
651 public void setDescription(String desc)
653 this.description = desc;
659 * @return DOCUMENT ME!
662 public String getDescription()
664 return this.description;
671 public int findIndex(int pos)
674 * use a valid, hopefully nearby, cursor if available
676 if (isValidCursor(cursor))
678 return findIndex(pos, cursor);
686 * traverse sequence from the start counting gaps; make a note of
687 * the column of the first residue to save in the cursor
689 while ((i < sequence.length) && (j <= end) && (j <= pos))
691 if (!Comparison.isGap(sequence[i]))
702 if (j == end && j < pos)
707 updateCursor(pos, i, startColumn);
712 * Updates the cursor to the latest found residue and column position
719 * column position of the first sequence residue
721 protected void updateCursor(int residuePos, int column, int startColumn)
724 * preserve end residue column provided cursor was valid
726 int endColumn = isValidCursor(cursor) ? cursor.lastColumnPosition : 0;
728 if (residuePos == this.end)
733 cursor = new SequenceCursor(this, residuePos, column, startColumn,
734 endColumn, this.changeCount);
738 * Answers the aligned column position (1..) for the given residue position
739 * (start..) given a 'hint' of a residue/column location in the neighbourhood.
740 * The hint may be left of, at, or to the right of the required position.
746 protected int findIndex(int pos, SequenceCursor curs)
748 if (!isValidCursor(curs))
751 * wrong or invalidated cursor, compute de novo
753 return findIndex(pos);
756 if (curs.residuePosition == pos)
758 return curs.columnPosition;
762 * move left or right to find pos from hint.position
764 int col = curs.columnPosition - 1; // convert from base 1 to base 0
765 int newPos = curs.residuePosition;
766 int delta = newPos > pos ? -1 : 1;
768 while (newPos != pos)
770 col += delta; // shift one column left or right
771 if (col < 0 || col == sequence.length)
775 if (!Comparison.isGap(sequence[col]))
781 col++; // convert back to base 1
782 updateCursor(pos, col, curs.firstColumnPosition);
791 public int findPosition(final int column)
794 * use a valid, hopefully nearby, cursor if available
796 if (isValidCursor(cursor))
798 return findPosition(column + 1, cursor);
801 // TODO recode this more naturally i.e. count residues only
802 // as they are found, not 'in anticipation'
805 * traverse the sequence counting gaps; note the column position
806 * of the first residue, to save in the cursor
808 int firstResidueColumn = 0;
809 int lastPosFound = 0;
810 int lastPosFoundColumn = 0;
811 int seqlen = sequence.length;
813 if (seqlen > 0 && !Comparison.isGap(sequence[0]))
815 lastPosFound = start;
816 lastPosFoundColumn = 0;
822 while (j < column && j < seqlen)
824 if (!Comparison.isGap(sequence[j]))
827 lastPosFoundColumn = j;
828 if (pos == this.start)
830 firstResidueColumn = j;
836 if (j < seqlen && !Comparison.isGap(sequence[j]))
839 lastPosFoundColumn = j;
840 if (pos == this.start)
842 firstResidueColumn = j;
847 * update the cursor to the last residue position found (if any)
848 * (converting column position to base 1)
850 if (lastPosFound != 0)
852 updateCursor(lastPosFound, lastPosFoundColumn + 1,
853 firstResidueColumn + 1);
860 * Answers true if the given cursor is not null, is for this sequence object,
861 * and has a token value that matches this object's changeCount, else false.
862 * This allows us to ignore a cursor as 'stale' if the sequence has been
863 * modified since the cursor was created.
868 protected boolean isValidCursor(SequenceCursor curs)
870 if (curs == null || curs.sequence != this || curs.token != changeCount)
875 * sanity check against range
877 if (curs.columnPosition < 0 || curs.columnPosition > sequence.length)
881 if (curs.residuePosition < start || curs.residuePosition > end)
889 * Answers the sequence position (start..) for the given aligned column
890 * position (1..), given a hint of a cursor in the neighbourhood. The cursor
891 * may lie left of, at, or to the right of the column position.
897 protected int findPosition(final int col, SequenceCursor curs)
899 if (!isValidCursor(curs))
902 * wrong or invalidated cursor, compute de novo
904 return findPosition(col - 1);// ugh back to base 0
907 if (curs.columnPosition == col)
909 cursor = curs; // in case this method becomes public
910 return curs.residuePosition; // easy case :-)
913 if (curs.lastColumnPosition > 0 && curs.lastColumnPosition < col)
916 * sequence lies entirely to the left of col
917 * - return last residue + 1
922 if (curs.firstColumnPosition > 0 && curs.firstColumnPosition > col)
925 * sequence lies entirely to the right of col
926 * - return first residue
931 // todo could choose closest to col out of column,
932 // firstColumnPosition, lastColumnPosition as a start point
935 * move left or right to find pos from cursor position
937 int firstResidueColumn = curs.firstColumnPosition;
938 int column = curs.columnPosition - 1; // to base 0
939 int newPos = curs.residuePosition;
940 int delta = curs.columnPosition > col ? -1 : 1;
941 boolean gapped = false;
942 int lastFoundPosition = curs.residuePosition;
943 int lastFoundPositionColumn = curs.columnPosition;
945 while (column != col - 1)
947 column += delta; // shift one column left or right
948 if (column < 0 || column == sequence.length)
952 gapped = Comparison.isGap(sequence[column]);
956 lastFoundPosition = newPos;
957 lastFoundPositionColumn = column + 1;
958 if (lastFoundPosition == this.start)
960 firstResidueColumn = column + 1;
965 if (cursor == null || lastFoundPosition != cursor.residuePosition)
967 updateCursor(lastFoundPosition, lastFoundPositionColumn,
972 * hack to give position to the right if on a gap
973 * or beyond the length of the sequence (see JAL-2562)
975 if (delta > 0 && (gapped || column >= sequence.length))
987 public Range findPositions(int fromColumn, int toColumn)
989 if (toColumn < fromColumn || fromColumn < 1)
995 * find the first non-gapped position, if any
997 int firstPosition = 0;
998 int col = fromColumn - 1;
999 int length = sequence.length;
1000 while (col < length && col < toColumn)
1002 if (!Comparison.isGap(sequence[col]))
1004 firstPosition = findPosition(col++);
1010 if (firstPosition == 0)
1016 * find the last non-gapped position
1018 int lastPosition = firstPosition;
1019 while (col < length && col < toColumn)
1021 if (!Comparison.isGap(sequence[col++]))
1027 return new Range(firstPosition, lastPosition);
1031 * Returns an int array where indices correspond to each residue in the
1032 * sequence and the element value gives its position in the alignment
1034 * @return int[SequenceI.getEnd()-SequenceI.getStart()+1] or null if no
1035 * residues in SequenceI object
1038 public int[] gapMap()
1040 String seq = jalview.analysis.AlignSeq.extractGaps(
1041 jalview.util.Comparison.GapChars, new String(sequence));
1042 int[] map = new int[seq.length()];
1046 while (j < sequence.length)
1048 if (!jalview.util.Comparison.isGap(sequence[j]))
1060 public int[] findPositionMap()
1062 int map[] = new int[sequence.length];
1065 int seqlen = sequence.length;
1066 while ((j < seqlen))
1069 if (!jalview.util.Comparison.isGap(sequence[j]))
1080 public List<int[]> getInsertions()
1082 ArrayList<int[]> map = new ArrayList<int[]>();
1083 int lastj = -1, j = 0;
1085 int seqlen = sequence.length;
1086 while ((j < seqlen))
1088 if (jalview.util.Comparison.isGap(sequence[j]))
1099 map.add(new int[] { lastj, j - 1 });
1107 map.add(new int[] { lastj, j - 1 });
1114 public BitSet getInsertionsAsBits()
1116 BitSet map = new BitSet();
1117 int lastj = -1, j = 0;
1119 int seqlen = sequence.length;
1120 while ((j < seqlen))
1122 if (jalview.util.Comparison.isGap(sequence[j]))
1148 public void deleteChars(int i, int j)
1150 int newstart = start, newend = end;
1151 if (i >= sequence.length || i < 0)
1156 char[] tmp = StringUtils.deleteChars(sequence, i, j);
1157 boolean createNewDs = false;
1158 // TODO: take a (second look) at the dataset creation validation method for
1159 // the very large sequence case
1160 int eindex = -1, sindex = -1;
1161 boolean ecalc = false, scalc = false;
1162 for (int s = i; s < j && s < sequence.length; s++)
1164 if (!Comparison.isGap(sequence[s]))
1174 sindex = findIndex(start) - 1;
1179 // delete characters including start of sequence
1180 newstart = findPosition(j);
1181 break; // don't need to search for any more residue characters.
1185 // delete characters after start.
1188 eindex = findIndex(end) - 1;
1193 // delete characters at end of sequence
1194 newend = findPosition(i - 1);
1195 break; // don't need to search for any more residue characters.
1200 newend--; // decrease end position by one for the deleted residue
1201 // and search further
1207 // deletion occured in the middle of the sequence
1208 if (createNewDs && this.datasetSequence != null)
1210 // construct a new sequence
1211 Sequence ds = new Sequence(datasetSequence);
1212 // TODO: remove any non-inheritable properties ?
1213 // TODO: create a sequence mapping (since there is a relation here ?)
1214 ds.deleteChars(i, j);
1215 datasetSequence = ds;
1224 public void insertCharAt(int i, int length, char c)
1226 char[] tmp = new char[sequence.length + length];
1228 if (i >= sequence.length)
1230 System.arraycopy(sequence, 0, tmp, 0, sequence.length);
1231 i = sequence.length;
1235 System.arraycopy(sequence, 0, tmp, 0, i);
1245 if (i < sequence.length)
1247 System.arraycopy(sequence, i, tmp, index, sequence.length - i);
1255 public void insertCharAt(int i, char c)
1257 insertCharAt(i, 1, c);
1261 public String getVamsasId()
1267 public void setVamsasId(String id)
1273 public void setDBRefs(DBRefEntry[] dbref)
1275 if (dbrefs == null && datasetSequence != null
1276 && this != datasetSequence)
1278 datasetSequence.setDBRefs(dbref);
1284 DBRefUtils.ensurePrimaries(this);
1289 public DBRefEntry[] getDBRefs()
1291 if (dbrefs == null && datasetSequence != null
1292 && this != datasetSequence)
1294 return datasetSequence.getDBRefs();
1300 public void addDBRef(DBRefEntry entry)
1302 if (datasetSequence != null)
1304 datasetSequence.addDBRef(entry);
1310 dbrefs = new DBRefEntry[0];
1313 for (DBRefEntryI dbr : dbrefs)
1315 if (dbr.updateFrom(entry))
1318 * found a dbref that either matched, or could be
1319 * updated from, the new entry - no need to add it
1326 * extend the array to make room for one more
1328 // TODO use an ArrayList instead
1329 int j = dbrefs.length;
1330 DBRefEntry[] temp = new DBRefEntry[j + 1];
1331 System.arraycopy(dbrefs, 0, temp, 0, j);
1332 temp[temp.length - 1] = entry;
1336 DBRefUtils.ensurePrimaries(this);
1340 public void setDatasetSequence(SequenceI seq)
1344 throw new IllegalArgumentException(
1345 "Implementation Error: self reference passed to SequenceI.setDatasetSequence");
1347 if (seq != null && seq.getDatasetSequence() != null)
1349 throw new IllegalArgumentException(
1350 "Implementation error: cascading dataset sequences are not allowed.");
1352 datasetSequence = seq;
1356 public SequenceI getDatasetSequence()
1358 return datasetSequence;
1362 public AlignmentAnnotation[] getAnnotation()
1364 return annotation == null ? null
1366 .toArray(new AlignmentAnnotation[annotation.size()]);
1370 public boolean hasAnnotation(AlignmentAnnotation ann)
1372 return annotation == null ? false : annotation.contains(ann);
1376 public void addAlignmentAnnotation(AlignmentAnnotation annotation)
1378 if (this.annotation == null)
1380 this.annotation = new Vector<AlignmentAnnotation>();
1382 if (!this.annotation.contains(annotation))
1384 this.annotation.addElement(annotation);
1386 annotation.setSequenceRef(this);
1390 public void removeAlignmentAnnotation(AlignmentAnnotation annotation)
1392 if (this.annotation != null)
1394 this.annotation.removeElement(annotation);
1395 if (this.annotation.size() == 0)
1397 this.annotation = null;
1403 * test if this is a valid candidate for another sequence's dataset sequence.
1406 private boolean isValidDatasetSequence()
1408 if (datasetSequence != null)
1412 for (int i = 0; i < sequence.length; i++)
1414 if (jalview.util.Comparison.isGap(sequence[i]))
1423 public SequenceI deriveSequence()
1425 Sequence seq = null;
1426 if (datasetSequence == null)
1428 if (isValidDatasetSequence())
1430 // Use this as dataset sequence
1431 seq = new Sequence(getName(), "", 1, -1);
1432 seq.setDatasetSequence(this);
1433 seq.initSeqFrom(this, getAnnotation());
1438 // Create a new, valid dataset sequence
1439 createDatasetSequence();
1442 return new Sequence(this);
1445 private boolean _isNa;
1447 private int _seqhash = 0;
1450 * Answers false if the sequence is more than 85% nucleotide (ACGTU), else
1454 public boolean isProtein()
1456 if (datasetSequence != null)
1458 return datasetSequence.isProtein();
1460 if (_seqhash != sequence.hashCode())
1462 _seqhash = sequence.hashCode();
1463 _isNa = Comparison.isNucleotide(this);
1471 * @see jalview.datamodel.SequenceI#createDatasetSequence()
1474 public SequenceI createDatasetSequence()
1476 if (datasetSequence == null)
1478 Sequence dsseq = new Sequence(getName(),
1479 AlignSeq.extractGaps(jalview.util.Comparison.GapChars,
1480 getSequenceAsString()),
1481 getStart(), getEnd());
1483 datasetSequence = dsseq;
1485 dsseq.setDescription(description);
1486 // move features and database references onto dataset sequence
1487 dsseq.sequenceFeatureStore = sequenceFeatureStore;
1488 sequenceFeatureStore = null;
1489 dsseq.dbrefs = dbrefs;
1491 // TODO: search and replace any references to this sequence with
1492 // references to the dataset sequence in Mappings on dbref
1493 dsseq.pdbIds = pdbIds;
1495 datasetSequence.updatePDBIds();
1496 if (annotation != null)
1498 // annotation is cloned rather than moved, to preserve what's currently
1500 for (AlignmentAnnotation aa : annotation)
1502 AlignmentAnnotation _aa = new AlignmentAnnotation(aa);
1503 _aa.sequenceRef = datasetSequence;
1504 _aa.adjustForAlignment(); // uses annotation's own record of
1505 // sequence-column mapping
1506 datasetSequence.addAlignmentAnnotation(_aa);
1510 return datasetSequence;
1517 * jalview.datamodel.SequenceI#setAlignmentAnnotation(AlignmmentAnnotation[]
1521 public void setAlignmentAnnotation(AlignmentAnnotation[] annotations)
1523 if (annotation != null)
1525 annotation.removeAllElements();
1527 if (annotations != null)
1529 for (int i = 0; i < annotations.length; i++)
1531 if (annotations[i] != null)
1533 addAlignmentAnnotation(annotations[i]);
1540 public AlignmentAnnotation[] getAnnotation(String label)
1542 if (annotation == null || annotation.size() == 0)
1547 Vector<AlignmentAnnotation> subset = new Vector<AlignmentAnnotation>();
1548 Enumeration<AlignmentAnnotation> e = annotation.elements();
1549 while (e.hasMoreElements())
1551 AlignmentAnnotation ann = e.nextElement();
1552 if (ann.label != null && ann.label.equals(label))
1554 subset.addElement(ann);
1557 if (subset.size() == 0)
1561 AlignmentAnnotation[] anns = new AlignmentAnnotation[subset.size()];
1563 e = subset.elements();
1564 while (e.hasMoreElements())
1566 anns[i++] = e.nextElement();
1568 subset.removeAllElements();
1573 public boolean updatePDBIds()
1575 if (datasetSequence != null)
1577 // TODO: could merge DBRefs
1578 return datasetSequence.updatePDBIds();
1580 if (dbrefs == null || dbrefs.length == 0)
1584 boolean added = false;
1585 for (DBRefEntry dbr : dbrefs)
1587 if (DBRefSource.PDB.equals(dbr.getSource()))
1590 * 'Add' any PDB dbrefs as a PDBEntry - add is only performed if the
1591 * PDB id is not already present in a 'matching' PDBEntry
1592 * Constructor parses out a chain code if appended to the accession id
1593 * (a fudge used to 'store' the chain code in the DBRef)
1595 PDBEntry pdbe = new PDBEntry(dbr);
1596 added |= addPDBId(pdbe);
1603 public void transferAnnotation(SequenceI entry, Mapping mp)
1605 if (datasetSequence != null)
1607 datasetSequence.transferAnnotation(entry, mp);
1610 if (entry.getDatasetSequence() != null)
1612 transferAnnotation(entry.getDatasetSequence(), mp);
1615 // transfer any new features from entry onto sequence
1616 if (entry.getSequenceFeatures() != null)
1619 List<SequenceFeature> sfs = entry.getSequenceFeatures();
1620 for (SequenceFeature feature : sfs)
1622 SequenceFeature sf[] = (mp != null) ? mp.locateFeature(feature)
1623 : new SequenceFeature[] { new SequenceFeature(feature) };
1626 for (int sfi = 0; sfi < sf.length; sfi++)
1628 addSequenceFeature(sf[sfi]);
1634 // transfer PDB entries
1635 if (entry.getAllPDBEntries() != null)
1637 Enumeration<PDBEntry> e = entry.getAllPDBEntries().elements();
1638 while (e.hasMoreElements())
1640 PDBEntry pdb = e.nextElement();
1644 // transfer database references
1645 DBRefEntry[] entryRefs = entry.getDBRefs();
1646 if (entryRefs != null)
1648 for (int r = 0; r < entryRefs.length; r++)
1650 DBRefEntry newref = new DBRefEntry(entryRefs[r]);
1651 if (newref.getMap() != null && mp != null)
1653 // remap ref using our local mapping
1655 // we also assume all version string setting is done by dbSourceProxy
1657 * if (!newref.getSource().equalsIgnoreCase(dbSource)) {
1658 * newref.setSource(dbSource); }
1666 * @return The index (zero-based) on this sequence in the MSA. It returns
1667 * {@code -1} if this information is not available.
1670 public int getIndex()
1676 * Defines the position of this sequence in the MSA. Use the value {@code -1}
1677 * if this information is undefined.
1680 * position for this sequence. This value is zero-based (zero for
1681 * this first sequence)
1684 public void setIndex(int value)
1690 public void setRNA(RNA r)
1702 public List<AlignmentAnnotation> getAlignmentAnnotations(String calcId,
1705 List<AlignmentAnnotation> result = new ArrayList<AlignmentAnnotation>();
1706 if (this.annotation != null)
1708 for (AlignmentAnnotation ann : annotation)
1710 if (ann.calcId != null && ann.calcId.equals(calcId)
1711 && ann.label != null && ann.label.equals(label))
1721 public String toString()
1723 return getDisplayId(false);
1727 public PDBEntry getPDBEntry(String pdbIdStr)
1729 if (getDatasetSequence() != null)
1731 return getDatasetSequence().getPDBEntry(pdbIdStr);
1737 List<PDBEntry> entries = getAllPDBEntries();
1738 for (PDBEntry entry : entries)
1740 if (entry.getId().equalsIgnoreCase(pdbIdStr))
1749 public List<DBRefEntry> getPrimaryDBRefs()
1751 if (datasetSequence != null)
1753 return datasetSequence.getPrimaryDBRefs();
1755 if (dbrefs == null || dbrefs.length == 0)
1757 return Collections.emptyList();
1759 synchronized (dbrefs)
1761 List<DBRefEntry> primaries = new ArrayList<DBRefEntry>();
1762 DBRefEntry[] tmp = new DBRefEntry[1];
1763 for (DBRefEntry ref : dbrefs)
1765 if (!ref.isPrimaryCandidate())
1771 MapList mp = ref.getMap().getMap();
1772 if (mp.getFromLowest() > start || mp.getFromHighest() < end)
1774 // map only involves a subsequence, so cannot be primary
1778 // whilst it looks like it is a primary ref, we also sanity check type
1779 if (DBRefUtils.getCanonicalName(DBRefSource.PDB)
1780 .equals(DBRefUtils.getCanonicalName(ref.getSource())))
1782 // PDB dbrefs imply there should be a PDBEntry associated
1783 // TODO: tighten PDB dbrefs
1784 // formally imply Jalview has actually downloaded and
1785 // parsed the pdb file. That means there should be a cached file
1786 // handle on the PDBEntry, and a real mapping between sequence and
1787 // extracted sequence from PDB file
1788 PDBEntry pdbentry = getPDBEntry(ref.getAccessionId());
1789 if (pdbentry != null && pdbentry.getFile() != null)
1795 // check standard protein or dna sources
1797 DBRefEntry[] res = DBRefUtils.selectDbRefs(!isProtein(), tmp);
1798 if (res != null && res[0] == tmp[0])
1812 public List<SequenceFeature> findFeatures(int fromColumn, int toColumn,
1815 int startPos = findPosition(fromColumn - 1); // convert base 1 to base 0
1816 int endPos = fromColumn == toColumn ? startPos
1817 : findPosition(toColumn - 1);
1819 List<SequenceFeature> result = getFeatures().findFeatures(startPos,
1821 if (datasetSequence != null)
1823 result = datasetSequence.getFeatures().findFeatures(startPos, endPos,
1828 result = sequenceFeatureStore.findFeatures(startPos, endPos, types);
1832 * if end column is gapped, endPos may be to the right,
1833 * and we may have included adjacent or enclosing features;
1834 * remove any that are not enclosing, non-contact features
1836 if (endPos > this.end || Comparison.isGap(sequence[toColumn - 1]))
1838 ListIterator<SequenceFeature> it = result.listIterator();
1839 while (it.hasNext())
1841 SequenceFeature sf = it.next();
1842 int sfBegin = sf.getBegin();
1843 int sfEnd = sf.getEnd();
1844 int featureStartColumn = findIndex(sfBegin);
1845 if (featureStartColumn > toColumn)
1849 else if (featureStartColumn < fromColumn)
1851 int featureEndColumn = sfEnd == sfBegin ? featureStartColumn
1853 if (featureEndColumn < fromColumn)
1857 else if (featureEndColumn > toColumn && sf.isContactFeature())
1860 * remove an enclosing feature if it is a contact feature
1872 * Invalidates any stale cursors (forcing recalculation) by incrementing the
1873 * token that has to match the one presented by the cursor
1876 public void sequenceChanged()
1885 public int replace(char c1, char c2)
1892 synchronized (sequence)
1894 for (int c = 0; c < sequence.length; c++)
1896 if (sequence[c] == c1)