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 java.util.Hashtable;
24 import java.util.List;
29 * Data structure to hold and manipulate a multiple sequence alignment
31 public interface AlignmentI extends AnnotatedCollectionI
34 * Calculates the number of sequences in an alignment, excluding hidden
37 * @return Number of sequences in alignment
42 * Calculates the number of sequences in an alignment, including hidden
45 * @return Number of sequences in alignment
47 int getAbsoluteHeight();
51 * Calculates the maximum width of the alignment, including gaps.
53 * @return Greatest sequence length within alignment, or -1 if no sequences
60 * Calculates if this set of sequences (visible and invisible) are all the
63 * @return true if all sequences in alignment are the same length
68 * Calculates if this set of sequences is all the same length
70 * @param includeHidden
71 * optionally exclude hidden sequences from test
72 * @return true if all (or just visible) sequences are the same length
74 boolean isAligned(boolean includeHidden);
77 * Answers if the sequence at alignmentIndex is hidden
79 * @param alignmentIndex
81 * @return true if the sequence is hidden
83 boolean isHidden(int alignmentIndex);
86 * Gets sequences as a Synchronized collection
88 * @return All sequences in alignment.
91 List<SequenceI> getSequences();
94 * Gets sequences as a SequenceI[]
96 * @return All sequences in alignment.
98 SequenceI[] getSequencesArray();
101 * Find a specific sequence in this alignment.
104 * Index of required sequence.
106 * @return SequenceI at given index.
108 SequenceI getSequenceAt(int i);
111 * Find a specific sequence in this alignment.
114 * Index of required sequence in full alignment, i.e. if all columns
117 * @return SequenceI at given index.
119 SequenceI getSequenceAtAbsoluteIndex(int i);
122 * Returns a map of lists of sequences keyed by sequence name.
126 Map<String, List<SequenceI>> getSequencesByName();
129 * Add a new sequence to this alignment.
132 * New sequence will be added at end of alignment.
134 void addSequence(SequenceI seq);
137 * Used to set a particular index of the alignment with the given sequence.
140 * Index of sequence to be updated. if i>length, sequence will be
141 * added to end, with no intervening positions.
143 * New sequence to be inserted. The existing sequence at position i
145 * @return existing sequence (or null if i>current length)
147 SequenceI replaceSequenceAt(int i, SequenceI seq);
150 * Deletes a sequence from the alignment. Updates hidden sequences to account
151 * for the removed sequence. Do NOT use this method to delete sequences which
155 * Sequence to be deleted.
157 void deleteSequence(SequenceI s);
160 * Deletes a sequence from the alignment. Updates hidden sequences to account
161 * for the removed sequence. Do NOT use this method to delete sequences which
165 * Index of sequence to be deleted.
167 void deleteSequence(int i);
170 * Deletes a sequence in the alignment which has been hidden.
173 * Index of sequence to be deleted
175 void deleteHiddenSequence(int i);
178 * Finds sequence in alignment using sequence name as query.
181 * Id of sequence to search for.
183 * @return Sequence matching query, if found. If not found returns null.
185 SequenceI findName(String name);
187 SequenceI[] findSequenceMatch(String name);
190 * Finds index of a given sequence in the alignment.
193 * Sequence to look for.
195 * @return Index of sequence within the alignment or -1 if not found
197 int findIndex(SequenceI s);
200 * Returns the first group (in the order in which groups were added) that
201 * includes the given sequence instance and aligned position (base 0), or null
205 * - must be contained in the alignment (not a dataset sequence)
210 SequenceGroup findGroup(SequenceI seq, int position);
213 * Finds all groups that a given sequence is part of.
216 * Sequence in alignment.
218 * @return All groups containing given sequence.
220 SequenceGroup[] findAllGroups(SequenceI s);
223 * Adds a new SequenceGroup to this alignment.
226 * New group to be added.
228 void addGroup(SequenceGroup sg);
231 * Deletes a specific SequenceGroup
234 * Group will be deleted from alignment.
236 void deleteGroup(SequenceGroup g);
239 * Get all the groups associated with this alignment.
241 * @return All groups as a list.
243 List<SequenceGroup> getGroups();
246 * Deletes all groups from this alignment.
248 void deleteAllGroups();
251 * Adds a new AlignmentAnnotation to this alignment
253 * @note Care should be taken to ensure that annotation is at least as wide as
254 * the longest sequence in the alignment for rendering purposes.
256 void addAnnotation(AlignmentAnnotation aa);
259 * moves annotation to a specified index in alignment annotation display stack
262 * the annotation object to be moved
264 * the destination position
266 void setAnnotationIndex(AlignmentAnnotation aa, int index);
269 * Delete all annotations, including auto-calculated if the flag is set true.
270 * Returns true if at least one annotation was deleted, else false.
272 * @param includingAutoCalculated
275 boolean deleteAllAnnotations(boolean includingAutoCalculated);
278 * Deletes a specific AlignmentAnnotation from the alignment, and removes its
279 * reference from any SequenceI or SequenceGroup object's annotation if and
280 * only if aa is contained within the alignment's annotation vector.
281 * Otherwise, it will do nothing.
284 * the annotation to delete
285 * @return true if annotation was deleted from this alignment.
287 boolean deleteAnnotation(AlignmentAnnotation aa);
290 * Deletes a specific AlignmentAnnotation from the alignment, and optionally
291 * removes any reference from any SequenceI or SequenceGroup object's
292 * annotation if and only if aa is contained within the alignment's annotation
293 * vector. Otherwise, it will do nothing.
296 * the annotation to delete
298 * flag indicating if any references should be removed from
299 * annotation - use this if you intend to add the annotation back
301 * @return true if annotation was deleted from this alignment.
303 boolean deleteAnnotation(AlignmentAnnotation aa, boolean unhook);
306 * Get the annotation associated with this alignment (this can be null if no
307 * annotation has ever been created on the alignment)
309 * @return array of AlignmentAnnotation objects
312 AlignmentAnnotation[] getAlignmentAnnotation();
315 * Change the gap character used in this alignment to 'gc'
318 * the new gap character.
320 void setGapCharacter(char gc);
323 * Get the gap character used in this alignment
325 * @return gap character
327 char getGapCharacter();
330 * Test if alignment contains RNA structure
332 * @return true if RNA structure AligmnentAnnotation was added to alignment
334 boolean hasRNAStructure();
337 * Get the associated dataset for the alignment.
339 * @return Alignment containing dataset sequences or null of this is a
342 AlignmentI getDataset();
345 * Set the associated dataset for the alignment, or create one.
348 * The dataset alignment or null to construct one.
350 void setDataset(AlignmentI dataset);
353 * pads sequences with gaps (to ensure the set looks like an alignment)
355 * @return boolean true if alignment was modified
359 HiddenSequences getHiddenSequences();
361 HiddenColumns getHiddenColumns();
364 * Compact representation of alignment
368 CigarArray getCompactAlignment();
371 * Set an arbitrary key value pair for an alignment. Note: both key and value
372 * objects should return a meaningful, human readable response to .toString()
377 void setProperty(Object key, Object value);
380 * Get a named property from the alignment.
383 * @return value of property
385 Object getProperty(Object key);
388 * Get the property hashtable.
390 * @return hashtable of alignment properties (or null if none are defined)
392 Hashtable getProperties();
395 * add a reference to a frame of aligned codons for this alignment
399 void addCodonFrame(AlignedCodonFrame codons);
402 * remove a particular codon frame reference from this alignment
405 * @return true if codon frame was removed.
407 boolean removeCodonFrame(AlignedCodonFrame codons);
410 * get all codon frames associated with this alignment
414 List<AlignedCodonFrame> getCodonFrames();
417 * Set the codon frame mappings (replacing any existing list).
419 void setCodonFrames(List<AlignedCodonFrame> acfs);
422 * get codon frames involving sequenceI
424 List<AlignedCodonFrame> getCodonFrame(SequenceI seq);
427 * find sequence with given name in alignment
432 * true implies that case insensitive matching will <em>also</em> be
434 * @return matched sequence or null
436 SequenceI findName(String token, boolean b);
439 * find next sequence with given name in alignment starting after a given
443 * the sequence after which the search will be started (usually the
444 * result of the last call to findName)
448 * true implies that case insensitive matching will <em>also</em> be
450 * @return matched sequence or null
452 SequenceI findName(SequenceI startAfter, String token, boolean b);
455 * find first sequence in alignment which is involved in the given search
459 * @return -1 or index of sequence in alignment
461 int findIndex(SearchResultsI results);
464 * append sequences and annotation from another alignment object to this one.
465 * Note: this is a straight transfer of object references, and may result in
466 * toappend's dependent data being transformed to fit the alignment (changing
467 * gap characters, etc...). If you are uncertain, use the copy Alignment copy
468 * constructor to create a new version which can be appended without side
472 * - the alignment to be appended.
474 void append(AlignmentI toappend);
477 * Justify the sequences to the left or right by deleting and inserting gaps
478 * before the initial residue or after the terminal residue
481 * true if alignment padded to right, false to justify to left
482 * @return true if alignment was changed TODO: return undo object
484 boolean justify(boolean right);
487 * add given annotation row at given position (0 is start, -1 is end)
492 void addAnnotation(AlignmentAnnotation consensus, int i);
495 * search for or create a specific annotation row on the alignment
498 * name for annotation (must match)
500 * calcId for the annotation (null or must match)
502 * - value of autocalc flag for the annotation
504 * - null or specific sequence reference
506 * - null or specific group reference
508 * - CalcId for the annotation (must match)
510 * @return existing annotation matching the given attributes
512 AlignmentAnnotation findOrCreateAnnotation(String name, String calcId,
513 boolean autoCalc, SequenceI seqRef, SequenceGroup groupRef);
516 * move the given group up or down in the alignment by the given number of
517 * rows. Implementor assumes given group is already present on alignment - no
518 * recalculations are triggered.
525 void moveSelectedSequencesByOne(SequenceGroup sg,
526 Map<SequenceI, SequenceCollectionI> map, boolean up);
529 * validate annotation after an edit and update any alignment state flags
532 * @param alignmentAnnotation
534 void validateAnnotation(AlignmentAnnotation alignmentAnnotation);
537 * Align this alignment the same as the given one. If both of the same type
538 * (nucleotide/protein) then align both identically. If this is nucleotide and
539 * the other is protein, make 3 gaps for each gap in the protein sequences. If
540 * this is protein and the other is nucleotide, insert a gap for each 3 gaps
541 * (or part thereof) between nucleotide bases. Returns the number of mapped
542 * sequences that were realigned .
547 int alignAs(AlignmentI al);
550 * Returns the set of distinct sequence names in the alignment.
554 Set<String> getSequenceNames();
557 * Checks if the alignment has at least one sequence with one non-gaped
562 public boolean hasValidSequence();
565 * Update any mappings to 'virtual' sequences to compatible real ones, if
566 * present in the added sequences. Returns a count of mappings updated.
571 int realiseMappings(List<SequenceI> seqs);
574 * Returns the first AlignedCodonFrame that has a mapping between the given
581 AlignedCodonFrame getMapping(SequenceI mapFrom, SequenceI mapTo);
583 public void setHiddenColumns(HiddenColumns cols);