2 * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.2)
3 * Copyright (C) 2014 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.util.MapList;
25 import java.util.Enumeration;
26 import java.util.Vector;
29 * Stores mapping between the columns of a protein alignment and a DNA alignment
30 * and a list of individual codon to amino acid mappings between sequences.
33 public class AlignedCodonFrame
36 * array of nucleotide positions for aligned codons at column of aligned
39 public int[][] codons = null;
42 * width of protein sequence alignement implicit assertion that codons.length
45 public int aaWidth = 0;
48 * initialise codon frame with a nominal alignment width
52 public AlignedCodonFrame(int aWidth)
59 codons = new int[aWidth][];
60 for (int res = 0; res < aWidth; res++)
67 * ensure that codons array is at least as wide as aslen residues
70 * @return (possibly newly expanded) codon array
72 public int[][] checkCodonFrameWidth(int aslen)
74 if (codons.length <= aslen + 1)
76 // probably never have to do this ?
77 int[][] c = new int[codons.length + 10][];
78 for (int i = 0; i < codons.length; i++)
89 * @return width of aligned translated amino acid residues
91 public int getaaWidth()
97 * TODO: not an ideal solution - we reference the aligned amino acid sequences
98 * in order to make insertions on them Better would be dnaAlignment and
99 * aaAlignment reference....
101 Vector a_aaSeqs = new Vector();
104 * increase aaWidth by one and insert a new aligned codon position space at
109 public void insertAAGap(int aspos, char gapCharacter)
111 // this aa appears before the aligned codons at aspos - so shift them in
112 // each pair of mapped sequences
114 if (a_aaSeqs != null)
116 // we actually have to modify the aligned sequences here, so use the
118 Enumeration sq = a_aaSeqs.elements();
119 while (sq.hasMoreElements())
121 ((SequenceI) sq.nextElement()).insertCharAt(aspos, gapCharacter);
124 checkCodonFrameWidth(aspos);
128 System.arraycopy(codons, aspos, codons, aspos + 1, codons.length
130 codons[aspos] = null; // clear so new codon position can be marked.
134 public void setAaWidth(int aapos)
140 * tied array of na Sequence objects.
142 SequenceI[] dnaSeqs = null;
145 * tied array of Mappings to protein sequence Objects and SequenceI[]
146 * aaSeqs=null; MapLists where eac maps from the corresponding dnaSeqs element
147 * to corresponding aaSeqs element
149 Mapping[] dnaToProt = null;
152 * add a mapping between the dataset sequences for the associated dna and
153 * protein sequence objects
159 public void addMap(SequenceI dnaseq, SequenceI aaseq, MapList map)
164 nlen = dnaSeqs.length + 1;
166 SequenceI[] ndna = new SequenceI[nlen];
167 Mapping[] ndtp = new Mapping[nlen];
170 System.arraycopy(dnaSeqs, 0, ndna, 0, dnaSeqs.length);
171 System.arraycopy(dnaToProt, 0, ndtp, 0, dnaSeqs.length);
176 dnaSeqs[nlen] = (dnaseq.getDatasetSequence() == null) ? dnaseq : dnaseq
177 .getDatasetSequence();
178 Mapping mp = new Mapping(map);
179 // JBPNote DEBUG! THIS !
180 // dnaseq.transferAnnotation(aaseq, mp);
181 // aaseq.transferAnnotation(dnaseq, new Mapping(map.getInverse()));
182 mp.to = (aaseq.getDatasetSequence() == null) ? aaseq : aaseq
183 .getDatasetSequence();
184 a_aaSeqs.addElement(aaseq);
185 dnaToProt[nlen] = mp;
188 public SequenceI[] getdnaSeqs()
193 public SequenceI[] getAaSeqs()
195 if (dnaToProt == null)
199 SequenceI[] sqs = new SequenceI[dnaToProt.length];
200 for (int sz = 0; sz < dnaToProt.length; sz++)
202 sqs[sz] = dnaToProt[sz].to;
207 public MapList[] getdnaToProt()
209 if (dnaToProt == null)
213 MapList[] sqs = new MapList[dnaToProt.length];
214 for (int sz = 0; sz < dnaToProt.length; sz++)
216 sqs[sz] = dnaToProt[sz].map;
221 public Mapping[] getProtMappings()
229 * @return null or corresponding aaSeq entry for dnaSeq entry
231 public SequenceI getAaForDnaSeq(SequenceI dnaSeqRef)
237 SequenceI dnads = dnaSeqRef.getDatasetSequence();
238 for (int ds = 0; ds < dnaSeqs.length; ds++)
240 if (dnaSeqs[ds] == dnaSeqRef || dnaSeqs[ds] == dnads)
242 return dnaToProt[ds].to;
251 * @return null or corresponding aaSeq entry for dnaSeq entry
253 public SequenceI getDnaForAaSeq(SequenceI aaSeqRef)
255 if (dnaToProt == null)
259 SequenceI aads = aaSeqRef.getDatasetSequence();
260 for (int as = 0; as < dnaToProt.length; as++)
262 if (dnaToProt[as].to == aaSeqRef || dnaToProt[as].to == aads)
271 * test to see if codon frame involves seq in any way
274 * a nucleotide or protein sequence
275 * @return true if a mapping exists to or from this sequence to any translated
278 public boolean involvesSequence(SequenceI seq)
280 return getAaForDnaSeq(seq) != null || getDnaForAaSeq(seq) != null;
284 * Add search results for regions in other sequences that translate or are
285 * translated from a particular position in seq
291 * where highlighted regions go
293 public void markMappedRegion(SequenceI seq, int index,
294 SearchResults results)
296 if (dnaToProt == null)
301 SequenceI ds = seq.getDatasetSequence();
302 for (int mi = 0; mi < dnaToProt.length; mi++)
304 if (dnaSeqs[mi] == seq || dnaSeqs[mi] == ds)
306 // DEBUG System.err.println("dna pos "+index);
307 codon = dnaToProt[mi].map.locateInTo(index, index);
310 for (int i = 0; i < codon.length; i += 2)
312 results.addResult(dnaToProt[mi].to, codon[i], codon[i + 1]);
316 else if (dnaToProt[mi].to == seq || dnaToProt[mi].to == ds)
318 // DEBUG System.err.println("aa pos "+index);
320 codon = dnaToProt[mi].map.locateInFrom(index, index);
323 for (int i = 0; i < codon.length; i += 2)
325 results.addResult(dnaSeqs[mi], codon[i], codon[i + 1]);