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.util.MapList;
24 import jalview.util.MappingUtils;
26 import java.util.AbstractList;
27 import java.util.ArrayList;
28 import java.util.List;
31 * Stores mapping between the columns of a protein alignment and a DNA alignment
32 * and a list of individual codon to amino acid mappings between sequences.
34 public class AlignedCodonFrame
38 * Data bean to hold mappings from one sequence to another
40 public class SequenceToSequenceMapping
42 private SequenceI fromSeq;
44 private Mapping mapping;
46 SequenceToSequenceMapping(SequenceI from, Mapping map)
53 * Readable representation for debugging only, not guaranteed not to change
56 public String toString()
58 return String.format("From %s %s", fromSeq.getName(),
63 * Returns a hashCode derived from the hashcodes of the mappings and fromSeq
65 * @see SequenceToSequenceMapping#hashCode()
70 return (fromSeq == null ? 0 : fromSeq.hashCode() * 31)
75 * Answers true if the objects hold the same mapping between the same two
81 public boolean equals(Object obj)
83 if (!(obj instanceof SequenceToSequenceMapping))
87 SequenceToSequenceMapping that = (SequenceToSequenceMapping) obj;
88 if (this.mapping == null)
90 return that.mapping == null;
92 // TODO: can simplify by asserting fromSeq is a dataset sequence
93 return (this.fromSeq == that.fromSeq
94 || (this.fromSeq != null && that.fromSeq != null
95 && this.fromSeq.getDatasetSequence() != null
96 && this.fromSeq.getDatasetSequence() == that.fromSeq
97 .getDatasetSequence()))
98 && this.mapping.equals(that.mapping);
101 public SequenceI getFromSeq()
106 public Mapping getMapping()
112 * Returns true if the mapping covers the full length of the given sequence.
113 * This allows us to distinguish the CDS that codes for a protein from
114 * another overlapping CDS in the parent dna sequence.
119 public boolean covers(SequenceI seq)
121 return covers(seq,false);
126 * @param localCover - when true - compare extent of seq's dataset sequence rather than the local extent
127 * @return true if mapping covers full length of given sequence
129 public boolean covers(SequenceI seq, boolean localCover)
131 List<int[]> mappedRanges = null;
132 MapList mapList = mapping.getMap();
133 int mstart=seq.getStart(),mend=seq.getEnd()
135 if (fromSeq == seq || fromSeq == seq.getDatasetSequence())
137 if (localCover && fromSeq !=seq)
139 mstart=fromSeq.getStart();
140 mend=fromSeq.getEnd();
142 mappedRanges = mapList.getFromRanges();
144 else if (mapping.to == seq || mapping.to == seq.getDatasetSequence())
146 if (localCover && mapping.to !=seq)
148 mstart=mapping.to.getStart();
149 mend=mapping.to.getEnd();
151 mappedRanges = mapList.getToRanges();
159 * check that each mapped range lieS with the sequence range
160 * (necessary for circular CDS - example EMBL:J03321:AAA91567)
161 * and mapped length covers (at least) sequence length
164 for (int[] range : mappedRanges)
166 int from = Math.min(range[0], range[1]);
167 int to = Math.max(range[0], range[1]);
168 if (from < mstart || to > mend)
172 length += (to - from + 1);
174 // add 1 to mapped length to allow for a mapped stop codon
175 if (length + 1 < (mend - mstart + 1))
183 private List<SequenceToSequenceMapping> mappings;
188 public AlignedCodonFrame()
190 mappings = new ArrayList<>();
194 * Adds a mapping between the dataset sequences for the associated dna and
195 * protein sequence objects
201 public void addMap(SequenceI dnaseq, SequenceI aaseq, MapList map)
203 addMap(dnaseq, aaseq, map, null);
207 * Adds a mapping between the dataset sequences for the associated dna and
208 * protein sequence objects
215 public void addMap(SequenceI dnaseq, SequenceI aaseq, MapList map,
218 // JBPNote DEBUG! THIS !
219 // dnaseq.transferAnnotation(aaseq, mp);
220 // aaseq.transferAnnotation(dnaseq, new Mapping(map.getInverse()));
222 SequenceI fromSeq = (dnaseq.getDatasetSequence() == null) ? dnaseq
223 : dnaseq.getDatasetSequence();
224 SequenceI toSeq = (aaseq.getDatasetSequence() == null) ? aaseq
225 : aaseq.getDatasetSequence();
228 * if we already hold a mapping between these sequences, just add to it
229 * note that 'adding' a duplicate map does nothing; this protects against
230 * creating duplicate mappings in AlignedCodonFrame
232 for (SequenceToSequenceMapping ssm : mappings)
234 if (ssm.fromSeq == fromSeq && ssm.mapping.to == toSeq)
236 ssm.mapping.map.addMapList(map);
242 * otherwise, add a new sequence mapping
244 Mapping mp = new Mapping(toSeq, map);
245 mp.setMappedFromId(mapFromId);
246 mappings.add(new SequenceToSequenceMapping(fromSeq, mp));
249 public SequenceI[] getdnaSeqs()
251 // TODO return a list instead?
253 List<SequenceI> seqs = new ArrayList<>();
254 for (SequenceToSequenceMapping ssm : mappings)
256 seqs.add(ssm.fromSeq);
258 return seqs.toArray(new SequenceI[seqs.size()]);
261 public SequenceI[] getAaSeqs()
263 // TODO not used - remove?
264 List<SequenceI> seqs = new ArrayList<>();
265 for (SequenceToSequenceMapping ssm : mappings)
267 seqs.add(ssm.mapping.to);
269 return seqs.toArray(new SequenceI[seqs.size()]);
272 public MapList[] getdnaToProt()
274 List<MapList> maps = new ArrayList<>();
275 for (SequenceToSequenceMapping ssm : mappings)
277 maps.add(ssm.mapping.map);
279 return maps.toArray(new MapList[maps.size()]);
282 public Mapping[] getProtMappings()
284 List<Mapping> maps = new ArrayList<>();
285 for (SequenceToSequenceMapping ssm : mappings)
287 maps.add(ssm.mapping);
289 return maps.toArray(new Mapping[maps.size()]);
293 * Returns the first mapping found which is to or from the given sequence, or
294 * null if none is found
299 public Mapping getMappingForSequence(SequenceI seq)
301 SequenceI seqDs = seq.getDatasetSequence();
302 seqDs = seqDs != null ? seqDs : seq;
304 for (SequenceToSequenceMapping ssm : mappings)
306 if (ssm.fromSeq == seqDs || ssm.mapping.to == seqDs)
315 * Return the corresponding aligned or dataset aa sequence for given dna
316 * sequence, null if not found.
321 public SequenceI getAaForDnaSeq(SequenceI dnaSeqRef)
323 SequenceI dnads = dnaSeqRef.getDatasetSequence();
324 for (SequenceToSequenceMapping ssm : mappings)
326 if (ssm.fromSeq == dnaSeqRef || ssm.fromSeq == dnads)
328 return ssm.mapping.to;
335 * Return the corresponding aligned or dataset dna sequence for given amino
336 * acid sequence, or null if not found. returns the sequence from the first
337 * mapping found that involves the protein sequence.
342 public SequenceI getDnaForAaSeq(SequenceI aaSeqRef)
344 SequenceI aads = aaSeqRef.getDatasetSequence();
345 for (SequenceToSequenceMapping ssm : mappings)
347 if (ssm.mapping.to == aaSeqRef || ssm.mapping.to == aads)
356 * test to see if codon frame involves seq in any way
359 * a nucleotide or protein sequence
360 * @return true if a mapping exists to or from this sequence to any translated
363 public boolean involvesSequence(SequenceI seq)
365 return getAaForDnaSeq(seq) != null || getDnaForAaSeq(seq) != null;
369 * Add search results for regions in other sequences that translate or are
370 * translated from a particular position in seq
376 * where highlighted regions go
378 public void markMappedRegion(SequenceI seq, int index,
379 SearchResultsI results)
382 SequenceI ds = seq.getDatasetSequence();
383 for (SequenceToSequenceMapping ssm : mappings)
385 if (ssm.fromSeq == seq || ssm.fromSeq == ds)
387 codon = ssm.mapping.map.locateInTo(index, index);
390 for (int i = 0; i < codon.length; i += 2)
392 results.addResult(ssm.mapping.to, codon[i], codon[i + 1]);
396 else if (ssm.mapping.to == seq || ssm.mapping.to == ds)
399 codon = ssm.mapping.map.locateInFrom(index, index);
402 for (int i = 0; i < codon.length; i += 2)
404 results.addResult(ssm.fromSeq, codon[i], codon[i + 1]);
413 * Returns the DNA codon positions (base 1) for the given position (base 1) in
414 * a mapped protein sequence, or null if no mapping is found.
416 * Intended for use in aligning cDNA to match aligned protein. Only the first
417 * mapping found is returned, so not suitable for use if multiple protein
418 * sequences are mapped to the same cDNA (but aligning cDNA as protein is
419 * ill-defined for this case anyway).
422 * the DNA dataset sequence
424 * residue position (base 1) in a protein sequence
427 public int[] getDnaPosition(SequenceI seq, int aaPos)
430 * Adapted from markMappedRegion().
434 for (SequenceToSequenceMapping ssm : mappings)
436 if (ssm.fromSeq == seq)
438 ml = getdnaToProt()[i];
443 return ml == null ? null : ml.locateInFrom(aaPos, aaPos);
447 * Convenience method to return the first aligned sequence in the given
448 * alignment whose dataset has a mapping with the given (aligned or dataset)
456 public SequenceI findAlignedSequence(SequenceI seq, AlignmentI al)
459 * Search mapped protein ('to') sequences first.
461 for (SequenceToSequenceMapping ssm : mappings)
463 if (ssm.fromSeq == seq || ssm.fromSeq == seq.getDatasetSequence())
465 for (SequenceI sourceAligned : al.getSequences())
467 if (ssm.covers(sourceAligned,true))
469 return sourceAligned;
476 * Then try mapped dna sequences.
478 for (SequenceToSequenceMapping ssm : mappings)
480 if (ssm.mapping.to == seq
481 || ssm.mapping.to == seq.getDatasetSequence())
483 for (SequenceI sourceAligned : al.getSequences())
485 if (ssm.covers(sourceAligned,true))
487 return sourceAligned;
497 * Returns the region in the target sequence's dataset that is mapped to the
498 * given position (base 1) in the query sequence's dataset. The region is a
499 * set of start/end position pairs.
506 public int[] getMappedRegion(SequenceI target, SequenceI query,
509 SequenceI targetDs = target.getDatasetSequence() == null ? target
510 : target.getDatasetSequence();
511 SequenceI queryDs = query.getDatasetSequence() == null ? query
512 : query.getDatasetSequence();
513 if (targetDs == null || queryDs == null /*|| dnaToProt == null*/)
517 for (SequenceToSequenceMapping ssm : mappings)
520 * try mapping from target to query
522 if (ssm.fromSeq == targetDs && ssm.mapping.to == queryDs)
524 int[] codon = ssm.mapping.map.locateInFrom(queryPos, queryPos);
531 * else try mapping from query to target
533 else if (ssm.fromSeq == queryDs && ssm.mapping.to == targetDs)
535 int[] codon = ssm.mapping.map.locateInTo(queryPos, queryPos);
546 * Returns the mapped DNA codons for the given position in a protein sequence,
547 * or null if no mapping is found. Returns a list of (e.g.) ['g', 'c', 't']
548 * codons. There may be more than one codon mapped to the protein if (for
549 * example), there are mappings to cDNA variants.
552 * the peptide dataset sequence
554 * residue position (base 1) in the peptide sequence
557 public List<char[]> getMappedCodons(SequenceI protein, int aaPos)
560 SequenceI dnaSeq = null;
561 List<char[]> result = new ArrayList<>();
563 for (SequenceToSequenceMapping ssm : mappings)
565 if (ssm.mapping.to == protein
566 && ssm.mapping.getMap().getFromRatio() == 3)
568 ml = ssm.mapping.map;
569 dnaSeq = ssm.fromSeq;
571 int[] codonPos = ml.locateInFrom(aaPos, aaPos);
572 if (codonPos == null)
578 * Read off the mapped nucleotides (converting to position base 0)
580 codonPos = MappingUtils.flattenRanges(codonPos);
581 int start = dnaSeq.getStart();
582 char c1 = dnaSeq.getCharAt(codonPos[0] - start);
583 char c2 = dnaSeq.getCharAt(codonPos[1] - start);
584 char c3 = dnaSeq.getCharAt(codonPos[2] - start);
585 result.add(new char[] { c1, c2, c3 });
588 return result.isEmpty() ? null : result;
592 * Returns any mappings found which are from the given sequence, and to
593 * distinct sequences.
598 public List<Mapping> getMappingsFromSequence(SequenceI seq)
600 List<Mapping> result = new ArrayList<>();
601 List<SequenceI> related = new ArrayList<>();
602 SequenceI seqDs = seq.getDatasetSequence();
603 seqDs = seqDs != null ? seqDs : seq;
605 for (SequenceToSequenceMapping ssm : mappings)
607 final Mapping mapping = ssm.mapping;
608 if (ssm.fromSeq == seqDs)
610 if (!related.contains(mapping.to))
613 related.add(mapping.to);
621 * Test whether the given sequence is substitutable for one or more dummy
622 * sequences in this mapping
628 public boolean isRealisableWith(SequenceI seq)
630 return realiseWith(seq, false) > 0;
634 * Replace any matchable mapped dummy sequences with the given real one.
635 * Returns the count of sequence mappings instantiated.
640 public int realiseWith(SequenceI seq)
642 return realiseWith(seq, true);
646 * Returns the number of mapped dummy sequences that could be replaced with
647 * the given real sequence.
652 * if true, performs replacements, else only counts
655 protected int realiseWith(SequenceI seq, boolean doUpdate)
657 SequenceI ds = seq.getDatasetSequence() != null
658 ? seq.getDatasetSequence()
663 * check for replaceable DNA ('map from') sequences
665 for (SequenceToSequenceMapping ssm : mappings)
667 SequenceI dna = ssm.fromSeq;
668 if (dna instanceof SequenceDummy
669 && dna.getName().equals(ds.getName()))
671 Mapping mapping = ssm.mapping;
672 int mapStart = mapping.getMap().getFromLowest();
673 int mapEnd = mapping.getMap().getFromHighest();
674 boolean mappable = couldRealiseSequence(dna, ds, mapStart, mapEnd);
680 // TODO: new method ? ds.realise(dna);
681 // might want to copy database refs as well
682 ds.setSequenceFeatures(dna.getSequenceFeatures());
685 System.out.println("Realised mapped sequence " + ds.getName());
691 * check for replaceable protein ('map to') sequences
693 Mapping mapping = ssm.mapping;
694 SequenceI prot = mapping.getTo();
695 int mapStart = mapping.getMap().getToLowest();
696 int mapEnd = mapping.getMap().getToHighest();
697 boolean mappable = couldRealiseSequence(prot, ds, mapStart, mapEnd);
703 // TODO: new method ? ds.realise(dna);
704 // might want to copy database refs as well
705 ds.setSequenceFeatures(dna.getSequenceFeatures());
706 ssm.mapping.setTo(ds);
714 * Helper method to test whether a 'real' sequence could replace a 'dummy'
715 * sequence in the map. The criteria are that they have the same name, and
716 * that the mapped region overlaps the candidate sequence.
724 protected static boolean couldRealiseSequence(SequenceI existing,
725 SequenceI replacement, int mapStart, int mapEnd)
727 if (existing instanceof SequenceDummy
728 && !(replacement instanceof SequenceDummy)
729 && existing.getName().equals(replacement.getName()))
731 int start = replacement.getStart();
732 int end = replacement.getEnd();
733 boolean mappingOverlapsSequence = (mapStart >= start
734 && mapStart <= end) || (mapEnd >= start && mapEnd <= end);
735 if (mappingOverlapsSequence)
744 * Change any mapping to the given sequence to be to its dataset sequence
745 * instead. For use when mappings are created before their referenced
746 * sequences are instantiated, for example when parsing GFF data.
750 public void updateToDataset(SequenceI seq)
752 if (seq == null || seq.getDatasetSequence() == null)
756 SequenceI ds = seq.getDatasetSequence();
758 for (SequenceToSequenceMapping ssm : mappings)
763 if (ssm.fromSeq == seq)
771 if (ssm.mapping.to == seq)
779 * Answers true if this object contains no mappings
783 public boolean isEmpty()
785 return mappings.isEmpty();
789 * Method for debug / inspection purposes only, may change in future
792 public String toString()
794 return mappings == null ? "null" : mappings.toString();
798 * Returns the first mapping found that is between 'fromSeq' and 'toSeq', or
802 * aligned or dataset sequence
804 * aligned or dataset sequence
807 public Mapping getMappingBetween(SequenceI fromSeq, SequenceI toSeq)
809 SequenceI dssFrom = fromSeq.getDatasetSequence() == null ? fromSeq
810 : fromSeq.getDatasetSequence();
811 SequenceI dssTo = toSeq.getDatasetSequence() == null ? toSeq
812 : toSeq.getDatasetSequence();
814 for (SequenceToSequenceMapping mapping : mappings)
816 SequenceI from = mapping.fromSeq;
817 SequenceI to = mapping.mapping.to;
818 if ((from == dssFrom && to == dssTo)
819 || (from == dssTo && to == dssFrom))
821 return mapping.mapping;
828 * Returns a hashcode derived from the list of sequence mappings
830 * @see SequenceToSequenceMapping#hashCode()
831 * @see AbstractList#hashCode()
834 public int hashCode()
836 return this.mappings.hashCode();
840 * Two AlignedCodonFrame objects are equal if they hold the same ordered list
843 * @see SequenceToSequenceMapping#equals
846 public boolean equals(Object obj)
848 if (!(obj instanceof AlignedCodonFrame))
852 return this.mappings.equals(((AlignedCodonFrame) obj).mappings);
855 public List<SequenceToSequenceMapping> getMappings()
861 * Returns the first mapping found which is between the two given sequences,
862 * and covers the full extent of both.
868 public SequenceToSequenceMapping getCoveringMapping(SequenceI seq1,
871 for (SequenceToSequenceMapping mapping : mappings)
873 if (mapping.covers(seq2) && mapping.covers(seq1))