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)
666 public void setDescription(String desc)
668 this.description = desc;
674 * @return DOCUMENT ME!
677 public String getDescription()
679 return this.description;
686 public int findIndex(int pos)
689 * use a valid, hopefully nearby, cursor if available
691 if (isValidCursor(cursor))
693 return findIndex(pos, cursor);
701 * traverse sequence from the start counting gaps; make a note of
702 * the column of the first residue to save in the cursor
704 while ((i < sequence.length) && (j <= end) && (j <= pos))
706 if (!Comparison.isGap(sequence[i]))
717 if (j == end && j < pos)
722 updateCursor(pos, i, startColumn);
727 * Updates the cursor to the latest found residue and column position
734 * column position of the first sequence residue
736 protected void updateCursor(int residuePos, int column, int startColumn)
739 * preserve end residue column provided cursor was valid
741 int endColumn = isValidCursor(cursor) ? cursor.lastColumnPosition : 0;
742 if (residuePos == this.end)
747 cursor = new SequenceCursor(this, residuePos, column, startColumn,
748 endColumn, this.changeCount);
752 * Answers the aligned column position (1..) for the given residue position
753 * (start..) given a 'hint' of a residue/column location in the neighbourhood.
754 * The hint may be left of, at, or to the right of the required position.
760 protected int findIndex(int pos, SequenceCursor curs)
762 if (!isValidCursor(curs))
765 * wrong or invalidated cursor, compute de novo
767 return findIndex(pos);
770 if (curs.residuePosition == pos)
772 return curs.columnPosition;
776 * move left or right to find pos from hint.position
778 int col = curs.columnPosition - 1; // convert from base 1 to 0-based array
780 int newPos = curs.residuePosition;
781 int delta = newPos > pos ? -1 : 1;
783 while (newPos != pos)
785 col += delta; // shift one column left or right
786 if (col < 0 || col == sequence.length)
790 if (!Comparison.isGap(sequence[col]))
796 col++; // convert back to base 1
797 updateCursor(pos, col, curs.firstColumnPosition);
806 public int findPosition(final int column)
809 * use a valid, hopefully nearby, cursor if available
811 if (isValidCursor(cursor))
813 return findPosition(column + 1, cursor);
816 // TODO recode this more naturally i.e. count residues only
817 // as they are found, not 'in anticipation'
820 * traverse the sequence counting gaps; note the column position
821 * of the first residue, to save in the cursor
823 int firstResidueColumn = 0;
824 int lastPosFound = 0;
825 int lastPosFoundColumn = 0;
826 int seqlen = sequence.length;
828 if (seqlen > 0 && !Comparison.isGap(sequence[0]))
830 lastPosFound = start;
831 lastPosFoundColumn = 0;
837 while (j < column && j < seqlen)
839 if (!Comparison.isGap(sequence[j]))
842 lastPosFoundColumn = j;
843 if (pos == this.start)
845 firstResidueColumn = j;
851 if (j < seqlen && !Comparison.isGap(sequence[j]))
854 lastPosFoundColumn = j;
855 if (pos == this.start)
857 firstResidueColumn = j;
862 * update the cursor to the last residue position found (if any)
863 * (converting column position to base 1)
865 if (lastPosFound != 0)
867 updateCursor(lastPosFound, lastPosFoundColumn + 1,
868 firstResidueColumn + 1);
875 * Answers true if the given cursor is not null, is for this sequence object,
876 * and has a token value that matches this object's changeCount, else false.
877 * This allows us to ignore a cursor as 'stale' if the sequence has been
878 * modified since the cursor was created.
883 protected boolean isValidCursor(SequenceCursor curs)
885 if (curs == null || curs.sequence != this || curs.token != changeCount)
890 * sanity check against range
892 if (curs.columnPosition < 0 || curs.columnPosition > sequence.length)
896 if (curs.residuePosition < start || curs.residuePosition > end)
904 * Answers the sequence position (start..) for the given aligned column
905 * position (1..), given a hint of a cursor in the neighbourhood. The cursor
906 * may lie left of, at, or to the right of the column position.
912 protected int findPosition(final int col, SequenceCursor curs)
914 if (!isValidCursor(curs))
917 * wrong or invalidated cursor, compute de novo
919 return findPosition(col - 1);// ugh back to base 0
922 if (curs.columnPosition == col)
924 cursor = curs; // in case this method becomes public
925 return curs.residuePosition; // easy case :-)
928 if (curs.lastColumnPosition > 0 && curs.lastColumnPosition < col)
931 * sequence lies entirely to the left of col
932 * - return last residue + 1
937 if (curs.firstColumnPosition > 0 && curs.firstColumnPosition > col)
940 * sequence lies entirely to the right of col
941 * - return first residue
946 // todo could choose closest to col out of column,
947 // firstColumnPosition, lastColumnPosition as a start point
950 * move left or right to find pos from cursor position
952 int firstResidueColumn = curs.firstColumnPosition;
953 int column = curs.columnPosition - 1; // to base 0
954 int newPos = curs.residuePosition;
955 int delta = curs.columnPosition > col ? -1 : 1;
956 boolean gapped = false;
957 int lastFoundPosition = curs.residuePosition;
958 int lastFoundPositionColumn = curs.columnPosition;
960 while (column != col - 1)
962 column += delta; // shift one column left or right
963 if (column < 0 || column == sequence.length)
967 gapped = Comparison.isGap(sequence[column]);
971 lastFoundPosition = newPos;
972 lastFoundPositionColumn = column + 1;
973 if (lastFoundPosition == this.start)
975 firstResidueColumn = column + 1;
980 if (cursor == null || lastFoundPosition != cursor.residuePosition)
982 updateCursor(lastFoundPosition, lastFoundPositionColumn,
987 * hack to give position to the right if on a gap
988 * or beyond the length of the sequence (see JAL-2562)
990 if (delta > 0 && (gapped || column >= sequence.length))
1002 public Range findPositions(int fromColumn, int toColumn)
1004 if (toColumn < fromColumn || fromColumn < 1)
1010 * find the first non-gapped position, if any
1012 int firstPosition = 0;
1013 int col = fromColumn - 1;
1014 int length = sequence.length;
1015 while (col < length && col < toColumn)
1017 if (!Comparison.isGap(sequence[col]))
1019 firstPosition = findPosition(col++);
1025 if (firstPosition == 0)
1031 * find the last non-gapped position
1033 int lastPosition = firstPosition;
1034 while (col < length && col < toColumn)
1036 if (!Comparison.isGap(sequence[col++]))
1042 return new Range(firstPosition, lastPosition);
1046 * Returns an int array where indices correspond to each residue in the
1047 * sequence and the element value gives its position in the alignment
1049 * @return int[SequenceI.getEnd()-SequenceI.getStart()+1] or null if no
1050 * residues in SequenceI object
1053 public int[] gapMap()
1055 String seq = jalview.analysis.AlignSeq.extractGaps(
1056 jalview.util.Comparison.GapChars, new String(sequence));
1057 int[] map = new int[seq.length()];
1061 while (j < sequence.length)
1063 if (!jalview.util.Comparison.isGap(sequence[j]))
1075 public int[] findPositionMap()
1077 int map[] = new int[sequence.length];
1080 int seqlen = sequence.length;
1081 while ((j < seqlen))
1084 if (!jalview.util.Comparison.isGap(sequence[j]))
1095 public List<int[]> getInsertions()
1097 ArrayList<int[]> map = new ArrayList<int[]>();
1098 int lastj = -1, j = 0;
1100 int seqlen = sequence.length;
1101 while ((j < seqlen))
1103 if (jalview.util.Comparison.isGap(sequence[j]))
1114 map.add(new int[] { lastj, j - 1 });
1122 map.add(new int[] { lastj, j - 1 });
1129 public BitSet getInsertionsAsBits()
1131 BitSet map = new BitSet();
1132 int lastj = -1, j = 0;
1134 int seqlen = sequence.length;
1135 while ((j < seqlen))
1137 if (jalview.util.Comparison.isGap(sequence[j]))
1163 public void deleteChars(final int i, final int j)
1165 int newstart = start, newend = end;
1166 if (i >= sequence.length || i < 0)
1171 char[] tmp = StringUtils.deleteChars(sequence, i, j);
1172 boolean createNewDs = false;
1173 // TODO: take a (second look) at the dataset creation validation method for
1174 // the very large sequence case
1175 int startIndex = findIndex(start) - 1;
1176 int endIndex = findIndex(end) - 1;
1177 int startDeleteColumn = -1; // for dataset sequence deletions
1178 int deleteCount = 0;
1180 for (int s = i; s < j; s++)
1182 if (Comparison.isGap(sequence[s]))
1187 if (startDeleteColumn == -1)
1189 startDeleteColumn = findPosition(s) - start;
1197 if (startIndex == s)
1200 * deleting characters from start of sequence; new start is the
1201 * sequence position of the next column (position to the right
1202 * if the column position is gapped)
1204 newstart = findPosition(j);
1212 * deleting characters at end of sequence; new end is the sequence
1213 * position of the column before the deletion; subtract 1 if this is
1214 * gapped since findPosition returns the next sequence position
1216 newend = findPosition(i - 1);
1217 if (Comparison.isGap(sequence[i - 1]))
1232 if (createNewDs && this.datasetSequence != null)
1235 * if deletion occured in the middle of the sequence,
1236 * construct a new dataset sequence and delete the residues
1237 * that were deleted from the aligned sequence
1239 Sequence ds = new Sequence(datasetSequence);
1240 ds.deleteChars(startDeleteColumn, startDeleteColumn + deleteCount);
1241 datasetSequence = ds;
1242 // TODO: remove any non-inheritable properties ?
1243 // TODO: create a sequence mapping (since there is a relation here ?)
1252 public void insertCharAt(int i, int length, char c)
1254 char[] tmp = new char[sequence.length + length];
1256 if (i >= sequence.length)
1258 System.arraycopy(sequence, 0, tmp, 0, sequence.length);
1259 i = sequence.length;
1263 System.arraycopy(sequence, 0, tmp, 0, i);
1273 if (i < sequence.length)
1275 System.arraycopy(sequence, i, tmp, index, sequence.length - i);
1283 public void insertCharAt(int i, char c)
1285 insertCharAt(i, 1, c);
1289 public String getVamsasId()
1295 public void setVamsasId(String id)
1301 public void setDBRefs(DBRefEntry[] dbref)
1303 if (dbrefs == null && datasetSequence != null
1304 && this != datasetSequence)
1306 datasetSequence.setDBRefs(dbref);
1312 DBRefUtils.ensurePrimaries(this);
1317 public DBRefEntry[] getDBRefs()
1319 if (dbrefs == null && datasetSequence != null
1320 && this != datasetSequence)
1322 return datasetSequence.getDBRefs();
1328 public void addDBRef(DBRefEntry entry)
1330 if (datasetSequence != null)
1332 datasetSequence.addDBRef(entry);
1338 dbrefs = new DBRefEntry[0];
1341 for (DBRefEntryI dbr : dbrefs)
1343 if (dbr.updateFrom(entry))
1346 * found a dbref that either matched, or could be
1347 * updated from, the new entry - no need to add it
1354 * extend the array to make room for one more
1356 // TODO use an ArrayList instead
1357 int j = dbrefs.length;
1358 DBRefEntry[] temp = new DBRefEntry[j + 1];
1359 System.arraycopy(dbrefs, 0, temp, 0, j);
1360 temp[temp.length - 1] = entry;
1364 DBRefUtils.ensurePrimaries(this);
1368 public void setDatasetSequence(SequenceI seq)
1372 throw new IllegalArgumentException(
1373 "Implementation Error: self reference passed to SequenceI.setDatasetSequence");
1375 if (seq != null && seq.getDatasetSequence() != null)
1377 throw new IllegalArgumentException(
1378 "Implementation error: cascading dataset sequences are not allowed.");
1380 datasetSequence = seq;
1384 public SequenceI getDatasetSequence()
1386 return datasetSequence;
1390 public AlignmentAnnotation[] getAnnotation()
1392 return annotation == null ? null
1394 .toArray(new AlignmentAnnotation[annotation.size()]);
1398 public boolean hasAnnotation(AlignmentAnnotation ann)
1400 return annotation == null ? false : annotation.contains(ann);
1404 public void addAlignmentAnnotation(AlignmentAnnotation annotation)
1406 if (this.annotation == null)
1408 this.annotation = new Vector<AlignmentAnnotation>();
1410 if (!this.annotation.contains(annotation))
1412 this.annotation.addElement(annotation);
1414 annotation.setSequenceRef(this);
1418 public void removeAlignmentAnnotation(AlignmentAnnotation annotation)
1420 if (this.annotation != null)
1422 this.annotation.removeElement(annotation);
1423 if (this.annotation.size() == 0)
1425 this.annotation = null;
1431 * test if this is a valid candidate for another sequence's dataset sequence.
1434 private boolean isValidDatasetSequence()
1436 if (datasetSequence != null)
1440 for (int i = 0; i < sequence.length; i++)
1442 if (jalview.util.Comparison.isGap(sequence[i]))
1451 public SequenceI deriveSequence()
1453 Sequence seq = null;
1454 if (datasetSequence == null)
1456 if (isValidDatasetSequence())
1458 // Use this as dataset sequence
1459 seq = new Sequence(getName(), "", 1, -1);
1460 seq.setDatasetSequence(this);
1461 seq.initSeqFrom(this, getAnnotation());
1466 // Create a new, valid dataset sequence
1467 createDatasetSequence();
1470 return new Sequence(this);
1473 private boolean _isNa;
1475 private int _seqhash = 0;
1478 * Answers false if the sequence is more than 85% nucleotide (ACGTU), else
1482 public boolean isProtein()
1484 if (datasetSequence != null)
1486 return datasetSequence.isProtein();
1488 if (_seqhash != sequence.hashCode())
1490 _seqhash = sequence.hashCode();
1491 _isNa = Comparison.isNucleotide(this);
1499 * @see jalview.datamodel.SequenceI#createDatasetSequence()
1502 public SequenceI createDatasetSequence()
1504 if (datasetSequence == null)
1506 Sequence dsseq = new Sequence(getName(),
1507 AlignSeq.extractGaps(jalview.util.Comparison.GapChars,
1508 getSequenceAsString()),
1509 getStart(), getEnd());
1511 datasetSequence = dsseq;
1513 dsseq.setDescription(description);
1514 // move features and database references onto dataset sequence
1515 dsseq.sequenceFeatureStore = sequenceFeatureStore;
1516 sequenceFeatureStore = null;
1517 dsseq.dbrefs = dbrefs;
1519 // TODO: search and replace any references to this sequence with
1520 // references to the dataset sequence in Mappings on dbref
1521 dsseq.pdbIds = pdbIds;
1523 datasetSequence.updatePDBIds();
1524 if (annotation != null)
1526 // annotation is cloned rather than moved, to preserve what's currently
1528 for (AlignmentAnnotation aa : annotation)
1530 AlignmentAnnotation _aa = new AlignmentAnnotation(aa);
1531 _aa.sequenceRef = datasetSequence;
1532 _aa.adjustForAlignment(); // uses annotation's own record of
1533 // sequence-column mapping
1534 datasetSequence.addAlignmentAnnotation(_aa);
1538 return datasetSequence;
1545 * jalview.datamodel.SequenceI#setAlignmentAnnotation(AlignmmentAnnotation[]
1549 public void setAlignmentAnnotation(AlignmentAnnotation[] annotations)
1551 if (annotation != null)
1553 annotation.removeAllElements();
1555 if (annotations != null)
1557 for (int i = 0; i < annotations.length; i++)
1559 if (annotations[i] != null)
1561 addAlignmentAnnotation(annotations[i]);
1568 public AlignmentAnnotation[] getAnnotation(String label)
1570 if (annotation == null || annotation.size() == 0)
1575 Vector<AlignmentAnnotation> subset = new Vector<AlignmentAnnotation>();
1576 Enumeration<AlignmentAnnotation> e = annotation.elements();
1577 while (e.hasMoreElements())
1579 AlignmentAnnotation ann = e.nextElement();
1580 if (ann.label != null && ann.label.equals(label))
1582 subset.addElement(ann);
1585 if (subset.size() == 0)
1589 AlignmentAnnotation[] anns = new AlignmentAnnotation[subset.size()];
1591 e = subset.elements();
1592 while (e.hasMoreElements())
1594 anns[i++] = e.nextElement();
1596 subset.removeAllElements();
1601 public boolean updatePDBIds()
1603 if (datasetSequence != null)
1605 // TODO: could merge DBRefs
1606 return datasetSequence.updatePDBIds();
1608 if (dbrefs == null || dbrefs.length == 0)
1612 boolean added = false;
1613 for (DBRefEntry dbr : dbrefs)
1615 if (DBRefSource.PDB.equals(dbr.getSource()))
1618 * 'Add' any PDB dbrefs as a PDBEntry - add is only performed if the
1619 * PDB id is not already present in a 'matching' PDBEntry
1620 * Constructor parses out a chain code if appended to the accession id
1621 * (a fudge used to 'store' the chain code in the DBRef)
1623 PDBEntry pdbe = new PDBEntry(dbr);
1624 added |= addPDBId(pdbe);
1631 public void transferAnnotation(SequenceI entry, Mapping mp)
1633 if (datasetSequence != null)
1635 datasetSequence.transferAnnotation(entry, mp);
1638 if (entry.getDatasetSequence() != null)
1640 transferAnnotation(entry.getDatasetSequence(), mp);
1643 // transfer any new features from entry onto sequence
1644 if (entry.getSequenceFeatures() != null)
1647 List<SequenceFeature> sfs = entry.getSequenceFeatures();
1648 for (SequenceFeature feature : sfs)
1650 SequenceFeature sf[] = (mp != null) ? mp.locateFeature(feature)
1651 : new SequenceFeature[] { new SequenceFeature(feature) };
1654 for (int sfi = 0; sfi < sf.length; sfi++)
1656 addSequenceFeature(sf[sfi]);
1662 // transfer PDB entries
1663 if (entry.getAllPDBEntries() != null)
1665 Enumeration<PDBEntry> e = entry.getAllPDBEntries().elements();
1666 while (e.hasMoreElements())
1668 PDBEntry pdb = e.nextElement();
1672 // transfer database references
1673 DBRefEntry[] entryRefs = entry.getDBRefs();
1674 if (entryRefs != null)
1676 for (int r = 0; r < entryRefs.length; r++)
1678 DBRefEntry newref = new DBRefEntry(entryRefs[r]);
1679 if (newref.getMap() != null && mp != null)
1681 // remap ref using our local mapping
1683 // we also assume all version string setting is done by dbSourceProxy
1685 * if (!newref.getSource().equalsIgnoreCase(dbSource)) {
1686 * newref.setSource(dbSource); }
1694 public void setRNA(RNA r)
1706 public List<AlignmentAnnotation> getAlignmentAnnotations(String calcId,
1709 List<AlignmentAnnotation> result = new ArrayList<AlignmentAnnotation>();
1710 if (this.annotation != null)
1712 for (AlignmentAnnotation ann : annotation)
1714 if (ann.calcId != null && ann.calcId.equals(calcId)
1715 && ann.label != null && ann.label.equals(label))
1725 public String toString()
1727 return getDisplayId(false);
1731 public PDBEntry getPDBEntry(String pdbIdStr)
1733 if (getDatasetSequence() != null)
1735 return getDatasetSequence().getPDBEntry(pdbIdStr);
1741 List<PDBEntry> entries = getAllPDBEntries();
1742 for (PDBEntry entry : entries)
1744 if (entry.getId().equalsIgnoreCase(pdbIdStr))
1753 public List<DBRefEntry> getPrimaryDBRefs()
1755 if (datasetSequence != null)
1757 return datasetSequence.getPrimaryDBRefs();
1759 if (dbrefs == null || dbrefs.length == 0)
1761 return Collections.emptyList();
1763 synchronized (dbrefs)
1765 List<DBRefEntry> primaries = new ArrayList<DBRefEntry>();
1766 DBRefEntry[] tmp = new DBRefEntry[1];
1767 for (DBRefEntry ref : dbrefs)
1769 if (!ref.isPrimaryCandidate())
1775 MapList mp = ref.getMap().getMap();
1776 if (mp.getFromLowest() > start || mp.getFromHighest() < end)
1778 // map only involves a subsequence, so cannot be primary
1782 // whilst it looks like it is a primary ref, we also sanity check type
1783 if (DBRefUtils.getCanonicalName(DBRefSource.PDB)
1784 .equals(DBRefUtils.getCanonicalName(ref.getSource())))
1786 // PDB dbrefs imply there should be a PDBEntry associated
1787 // TODO: tighten PDB dbrefs
1788 // formally imply Jalview has actually downloaded and
1789 // parsed the pdb file. That means there should be a cached file
1790 // handle on the PDBEntry, and a real mapping between sequence and
1791 // extracted sequence from PDB file
1792 PDBEntry pdbentry = getPDBEntry(ref.getAccessionId());
1793 if (pdbentry != null && pdbentry.getFile() != null)
1799 // check standard protein or dna sources
1801 DBRefEntry[] res = DBRefUtils.selectDbRefs(!isProtein(), tmp);
1802 if (res != null && res[0] == tmp[0])
1816 public List<SequenceFeature> findFeatures(int fromColumn, int toColumn,
1819 int startPos = findPosition(fromColumn - 1); // convert base 1 to base 0
1820 int endPos = fromColumn == toColumn ? startPos
1821 : findPosition(toColumn - 1);
1823 List<SequenceFeature> result = getFeatures().findFeatures(startPos,
1827 * if end column is gapped, endPos may be to the right,
1828 * and we may have included adjacent or enclosing features;
1829 * remove any that are not enclosing, non-contact features
1831 boolean endColumnIsGapped = toColumn > 0 && toColumn <= sequence.length
1832 && Comparison.isGap(sequence[toColumn - 1]);
1833 if (endPos > this.end || endColumnIsGapped)
1835 ListIterator<SequenceFeature> it = result.listIterator();
1836 while (it.hasNext())
1838 SequenceFeature sf = it.next();
1839 int sfBegin = sf.getBegin();
1840 int sfEnd = sf.getEnd();
1841 int featureStartColumn = findIndex(sfBegin);
1842 if (featureStartColumn > toColumn)
1846 else if (featureStartColumn < fromColumn)
1848 int featureEndColumn = sfEnd == sfBegin ? featureStartColumn
1850 if (featureEndColumn < fromColumn)
1854 else if (featureEndColumn > toColumn && sf.isContactFeature())
1857 * remove an enclosing feature if it is a contact feature
1869 * Invalidates any stale cursors (forcing recalculation) by incrementing the
1870 * token that has to match the one presented by the cursor
1873 public void sequenceChanged()
1882 public int replace(char c1, char c2)
1889 synchronized (sequence)
1891 for (int c = 0; c < sequence.length; c++)
1893 if (sequence[c] == c1)