2 * Jalview - A Sequence Alignment Editor and Viewer (Version 2.9)
3 * Copyright (C) 2015 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.analysis;
23 import jalview.datamodel.AlignedCodon;
24 import jalview.datamodel.AlignedCodonFrame;
25 import jalview.datamodel.Alignment;
26 import jalview.datamodel.AlignmentAnnotation;
27 import jalview.datamodel.AlignmentI;
28 import jalview.datamodel.DBRefEntry;
29 import jalview.datamodel.DBRefSource;
30 import jalview.datamodel.FeatureProperties;
31 import jalview.datamodel.Mapping;
32 import jalview.datamodel.SearchResults;
33 import jalview.datamodel.Sequence;
34 import jalview.datamodel.SequenceGroup;
35 import jalview.datamodel.SequenceI;
36 import jalview.schemes.ResidueProperties;
37 import jalview.util.DBRefUtils;
38 import jalview.util.MapList;
39 import jalview.util.MappingUtils;
41 import java.util.ArrayList;
42 import java.util.Arrays;
43 import java.util.Collection;
44 import java.util.HashMap;
45 import java.util.HashSet;
46 import java.util.Iterator;
47 import java.util.LinkedHashMap;
48 import java.util.LinkedHashSet;
49 import java.util.List;
51 import java.util.Map.Entry;
53 import java.util.TreeMap;
56 * grab bag of useful alignment manipulation operations Expect these to be
57 * refactored elsewhere at some point.
62 public class AlignmentUtils
66 * given an existing alignment, create a new alignment including all, or up to
67 * flankSize additional symbols from each sequence's dataset sequence
73 public static AlignmentI expandContext(AlignmentI core, int flankSize)
75 List<SequenceI> sq = new ArrayList<SequenceI>();
77 for (SequenceI s : core.getSequences())
79 SequenceI newSeq = s.deriveSequence();
80 final int newSeqStart = newSeq.getStart() - 1;
81 if (newSeqStart > maxoffset
82 && newSeq.getDatasetSequence().getStart() < s.getStart())
84 maxoffset = newSeqStart;
90 maxoffset = Math.min(maxoffset, flankSize);
94 * now add offset left and right to create an expanded alignment
96 for (SequenceI s : sq)
99 while (ds.getDatasetSequence() != null)
101 ds = ds.getDatasetSequence();
103 int s_end = s.findPosition(s.getStart() + s.getLength());
104 // find available flanking residues for sequence
105 int ustream_ds = s.getStart() - ds.getStart();
106 int dstream_ds = ds.getEnd() - s_end;
108 // build new flanked sequence
110 // compute gap padding to start of flanking sequence
111 int offset = maxoffset - ustream_ds;
113 // padding is gapChar x ( maxoffset - min(ustream_ds, flank)
116 if (flankSize < ustream_ds)
118 // take up to flankSize residues
119 offset = maxoffset - flankSize;
120 ustream_ds = flankSize;
122 if (flankSize <= dstream_ds)
124 dstream_ds = flankSize - 1;
127 // TODO use Character.toLowerCase to avoid creating String objects?
128 char[] upstream = new String(ds.getSequence(s.getStart() - 1
129 - ustream_ds, s.getStart() - 1)).toLowerCase().toCharArray();
130 char[] downstream = new String(ds.getSequence(s_end - 1, s_end
131 + dstream_ds)).toLowerCase().toCharArray();
132 char[] coreseq = s.getSequence();
133 char[] nseq = new char[offset + upstream.length + downstream.length
135 char c = core.getGapCharacter();
138 for (; p < offset; p++)
143 System.arraycopy(upstream, 0, nseq, p, upstream.length);
144 System.arraycopy(coreseq, 0, nseq, p + upstream.length,
146 System.arraycopy(downstream, 0, nseq, p + coreseq.length
147 + upstream.length, downstream.length);
148 s.setSequence(new String(nseq));
149 s.setStart(s.getStart() - ustream_ds);
150 s.setEnd(s_end + downstream.length);
152 AlignmentI newAl = new jalview.datamodel.Alignment(
153 sq.toArray(new SequenceI[0]));
154 for (SequenceI s : sq)
156 if (s.getAnnotation() != null)
158 for (AlignmentAnnotation aa : s.getAnnotation())
160 aa.adjustForAlignment(); // JAL-1712 fix
161 newAl.addAnnotation(aa);
165 newAl.setDataset(core.getDataset());
170 * Returns the index (zero-based position) of a sequence in an alignment, or
177 public static int getSequenceIndex(AlignmentI al, SequenceI seq)
181 for (SequenceI alSeq : al.getSequences())
194 * Returns a map of lists of sequences in the alignment, keyed by sequence
195 * name. For use in mapping between different alignment views of the same
198 * @see jalview.datamodel.AlignmentI#getSequencesByName()
200 public static Map<String, List<SequenceI>> getSequencesByName(
203 Map<String, List<SequenceI>> theMap = new LinkedHashMap<String, List<SequenceI>>();
204 for (SequenceI seq : al.getSequences())
206 String name = seq.getName();
209 List<SequenceI> seqs = theMap.get(name);
212 seqs = new ArrayList<SequenceI>();
213 theMap.put(name, seqs);
222 * Build mapping of protein to cDNA alignment. Mappings are made between
223 * sequences where the cDNA translates to the protein sequence. Any new
224 * mappings are added to the protein alignment. Returns true if any mappings
225 * either already exist or were added, else false.
227 * @param proteinAlignment
228 * @param cdnaAlignment
231 public static boolean mapProteinToCdna(final AlignmentI proteinAlignment,
232 final AlignmentI cdnaAlignment)
234 if (proteinAlignment == null || cdnaAlignment == null)
239 Set<SequenceI> mappedDna = new HashSet<SequenceI>();
240 Set<SequenceI> mappedProtein = new HashSet<SequenceI>();
243 * First pass - map sequences where cross-references exist. This include
244 * 1-to-many mappings to support, for example, variant cDNA.
246 boolean mappingPerformed = mapProteinToCdna(proteinAlignment,
247 cdnaAlignment, mappedDna, mappedProtein, true);
250 * Second pass - map sequences where no cross-references exist. This only
251 * does 1-to-1 mappings and assumes corresponding sequences are in the same
252 * order in the alignments.
254 mappingPerformed |= mapProteinToCdna(proteinAlignment, cdnaAlignment,
255 mappedDna, mappedProtein, false);
256 return mappingPerformed;
260 * Make mappings between compatible sequences (where the cDNA translation
261 * matches the protein).
263 * @param proteinAlignment
264 * @param cdnaAlignment
266 * a set of mapped DNA sequences (to add to)
267 * @param mappedProtein
268 * a set of mapped Protein sequences (to add to)
270 * if true, only map sequences where xrefs exist
273 protected static boolean mapProteinToCdna(
274 final AlignmentI proteinAlignment,
275 final AlignmentI cdnaAlignment, Set<SequenceI> mappedDna,
276 Set<SequenceI> mappedProtein, boolean xrefsOnly)
278 boolean mappingPerformed = false;
279 List<SequenceI> thisSeqs = proteinAlignment.getSequences();
280 for (SequenceI aaSeq : thisSeqs)
282 boolean proteinMapped = false;
283 AlignedCodonFrame acf = new AlignedCodonFrame();
285 for (SequenceI cdnaSeq : cdnaAlignment.getSequences())
288 * Always try to map if sequences have xref to each other; this supports
289 * variant cDNA or alternative splicing for a protein sequence.
291 * If no xrefs, try to map progressively, assuming that alignments have
292 * mappable sequences in corresponding order. These are not
293 * many-to-many, as that would risk mixing species with similar cDNA
296 if (xrefsOnly && !AlignmentUtils.haveCrossRef(aaSeq, cdnaSeq))
302 * Don't map non-xrefd sequences more than once each. This heuristic
303 * allows us to pair up similar sequences in ordered alignments.
306 && (mappedProtein.contains(aaSeq) || mappedDna
311 if (!mappingExists(proteinAlignment.getCodonFrames(),
312 aaSeq.getDatasetSequence(), cdnaSeq.getDatasetSequence()))
314 MapList map = mapProteinToCdna(aaSeq, cdnaSeq);
317 acf.addMap(cdnaSeq, aaSeq, map);
318 mappingPerformed = true;
319 proteinMapped = true;
320 mappedDna.add(cdnaSeq);
321 mappedProtein.add(aaSeq);
327 proteinAlignment.addCodonFrame(acf);
330 return mappingPerformed;
334 * Answers true if the mappings include one between the given (dataset)
337 public static boolean mappingExists(Set<AlignedCodonFrame> set,
338 SequenceI aaSeq, SequenceI cdnaSeq)
342 for (AlignedCodonFrame acf : set)
344 if (cdnaSeq == acf.getDnaForAaSeq(aaSeq))
354 * Build a mapping (if possible) of a protein to a cDNA sequence. The cDNA
355 * must be three times the length of the protein, possibly after ignoring
356 * start and/or stop codons, and must translate to the protein. Returns null
357 * if no mapping is determined.
363 public static MapList mapProteinToCdna(SequenceI proteinSeq,
367 * Here we handle either dataset sequence set (desktop) or absent (applet).
368 * Use only the char[] form of the sequence to avoid creating possibly large
371 final SequenceI proteinDataset = proteinSeq.getDatasetSequence();
372 char[] aaSeqChars = proteinDataset != null ? proteinDataset
373 .getSequence() : proteinSeq.getSequence();
374 final SequenceI cdnaDataset = cdnaSeq.getDatasetSequence();
375 char[] cdnaSeqChars = cdnaDataset != null ? cdnaDataset.getSequence()
376 : cdnaSeq.getSequence();
377 if (aaSeqChars == null || cdnaSeqChars == null)
383 * cdnaStart/End, proteinStartEnd are base 1 (for dataset sequence mapping)
385 final int mappedLength = 3 * aaSeqChars.length;
386 int cdnaLength = cdnaSeqChars.length;
388 int cdnaEnd = cdnaLength;
389 final int proteinStart = 1;
390 final int proteinEnd = aaSeqChars.length;
393 * If lengths don't match, try ignoring stop codon.
395 if (cdnaLength != mappedLength && cdnaLength > 2)
397 String lastCodon = String.valueOf(cdnaSeqChars, cdnaLength - 3, 3)
399 for (String stop : ResidueProperties.STOP)
401 if (lastCodon.equals(stop))
411 * If lengths still don't match, try ignoring start codon.
413 if (cdnaLength != mappedLength
415 && String.valueOf(cdnaSeqChars, 0, 3).toUpperCase()
416 .equals(ResidueProperties.START))
422 if (cdnaLength != mappedLength)
426 if (!translatesAs(cdnaSeqChars, cdnaStart - 1, aaSeqChars))
430 MapList map = new MapList(new int[] { cdnaStart, cdnaEnd }, new int[] {
431 proteinStart, proteinEnd }, 3, 1);
436 * Test whether the given cdna sequence, starting at the given offset,
437 * translates to the given amino acid sequence, using the standard translation
438 * table. Designed to fail fast i.e. as soon as a mismatch position is found.
440 * @param cdnaSeqChars
445 protected static boolean translatesAs(char[] cdnaSeqChars, int cdnaStart,
448 if (cdnaSeqChars == null || aaSeqChars == null)
454 for (int i = cdnaStart; i < cdnaSeqChars.length - 2
455 && aaResidue < aaSeqChars.length; i += 3, aaResidue++)
457 String codon = String.valueOf(cdnaSeqChars, i, 3);
458 final String translated = ResidueProperties.codonTranslate(codon);
460 * allow * in protein to match untranslatable in dna
462 final char aaRes = aaSeqChars[aaResidue];
463 if ((translated == null || "STOP".equals(translated)) && aaRes == '*')
467 if (translated == null || !(aaRes == translated.charAt(0)))
470 // System.out.println(("Mismatch at " + i + "/" + aaResidue + ": "
471 // + codon + "(" + translated + ") != " + aaRes));
475 // fail if we didn't match all of the aa sequence
476 return (aaResidue == aaSeqChars.length);
480 * Align sequence 'seq' to match the alignment of a mapped sequence. Note this
481 * currently assumes that we are aligning cDNA to match protein.
484 * the sequence to be realigned
486 * the alignment whose sequence alignment is to be 'copied'
488 * character string represent a gap in the realigned sequence
489 * @param preserveUnmappedGaps
490 * @param preserveMappedGaps
491 * @return true if the sequence was realigned, false if it could not be
493 public static boolean alignSequenceAs(SequenceI seq, AlignmentI al,
494 String gap, boolean preserveMappedGaps,
495 boolean preserveUnmappedGaps)
498 * Get any mappings from the source alignment to the target (dataset)
501 // TODO there may be one AlignedCodonFrame per dataset sequence, or one with
502 // all mappings. Would it help to constrain this?
503 List<AlignedCodonFrame> mappings = al.getCodonFrame(seq);
504 if (mappings == null || mappings.isEmpty())
510 * Locate the aligned source sequence whose dataset sequence is mapped. We
511 * just take the first match here (as we can't align cDNA like more than one
514 SequenceI alignFrom = null;
515 AlignedCodonFrame mapping = null;
516 for (AlignedCodonFrame mp : mappings)
518 alignFrom = mp.findAlignedSequence(seq.getDatasetSequence(), al);
519 if (alignFrom != null)
526 if (alignFrom == null)
530 alignSequenceAs(seq, alignFrom, mapping, gap, al.getGapCharacter(),
531 preserveMappedGaps, preserveUnmappedGaps);
536 * Align sequence 'alignTo' the same way as 'alignFrom', using the mapping to
537 * match residues and codons. Flags control whether existing gaps in unmapped
538 * (intron) and mapped (exon) regions are preserved or not. Gaps linking intro
539 * and exon are only retained if both flags are set.
546 * @param preserveUnmappedGaps
547 * @param preserveMappedGaps
549 public static void alignSequenceAs(SequenceI alignTo,
550 SequenceI alignFrom, AlignedCodonFrame mapping, String myGap,
551 char sourceGap, boolean preserveMappedGaps,
552 boolean preserveUnmappedGaps)
554 // TODO generalise to work for Protein-Protein, dna-dna, dna-protein
555 final char[] thisSeq = alignTo.getSequence();
556 final char[] thatAligned = alignFrom.getSequence();
557 StringBuilder thisAligned = new StringBuilder(2 * thisSeq.length);
559 // aligned and dataset sequence positions, all base zero
563 int basesWritten = 0;
564 char myGapChar = myGap.charAt(0);
565 int ratio = myGap.length();
568 * Traverse the aligned protein sequence.
570 int sourceGapMappedLength = 0;
571 boolean inExon = false;
572 for (char sourceChar : thatAligned)
574 if (sourceChar == sourceGap)
576 sourceGapMappedLength += ratio;
581 * Found a residue. Locate its mapped codon (start) position.
584 // Note mapping positions are base 1, our sequence positions base 0
585 int[] mappedPos = mapping.getMappedRegion(alignTo, alignFrom,
587 if (mappedPos == null)
590 * Abort realignment if unmapped protein. Or could ignore it??
592 System.err.println("Can't align: no codon mapping to residue "
593 + sourceDsPos + "(" + sourceChar + ")");
597 int mappedCodonStart = mappedPos[0]; // position (1...) of codon start
598 int mappedCodonEnd = mappedPos[mappedPos.length - 1]; // codon end pos
599 StringBuilder trailingCopiedGap = new StringBuilder();
602 * Copy dna sequence up to and including this codon. Optionally, include
603 * gaps before the codon starts (in introns) and/or after the codon starts
606 * Note this only works for 'linear' splicing, not reverse or interleaved.
607 * But then 'align dna as protein' doesn't make much sense otherwise.
609 int intronLength = 0;
610 while (basesWritten < mappedCodonEnd && thisSeqPos < thisSeq.length)
612 final char c = thisSeq[thisSeqPos++];
617 if (basesWritten < mappedCodonStart)
620 * Found an unmapped (intron) base. First add in any preceding gaps
623 if (preserveUnmappedGaps && trailingCopiedGap.length() > 0)
625 thisAligned.append(trailingCopiedGap.toString());
626 intronLength += trailingCopiedGap.length();
627 trailingCopiedGap = new StringBuilder();
634 final boolean startOfCodon = basesWritten == mappedCodonStart;
635 int gapsToAdd = calculateGapsToInsert(preserveMappedGaps,
636 preserveUnmappedGaps, sourceGapMappedLength, inExon,
637 trailingCopiedGap.length(), intronLength, startOfCodon);
638 for (int i = 0; i < gapsToAdd; i++)
640 thisAligned.append(myGapChar);
642 sourceGapMappedLength = 0;
645 thisAligned.append(c);
646 trailingCopiedGap = new StringBuilder();
650 if (inExon && preserveMappedGaps)
652 trailingCopiedGap.append(myGapChar);
654 else if (!inExon && preserveUnmappedGaps)
656 trailingCopiedGap.append(myGapChar);
663 * At end of protein sequence. Copy any remaining dna sequence, optionally
664 * including (intron) gaps. We do not copy trailing gaps in protein.
666 while (thisSeqPos < thisSeq.length)
668 final char c = thisSeq[thisSeqPos++];
669 if (c != myGapChar || preserveUnmappedGaps)
671 thisAligned.append(c);
676 * All done aligning, set the aligned sequence.
678 alignTo.setSequence(new String(thisAligned));
682 * Helper method to work out how many gaps to insert when realigning.
684 * @param preserveMappedGaps
685 * @param preserveUnmappedGaps
686 * @param sourceGapMappedLength
688 * @param trailingCopiedGap
689 * @param intronLength
690 * @param startOfCodon
693 protected static int calculateGapsToInsert(boolean preserveMappedGaps,
694 boolean preserveUnmappedGaps, int sourceGapMappedLength,
695 boolean inExon, int trailingGapLength, int intronLength,
696 final boolean startOfCodon)
702 * Reached start of codon. Ignore trailing gaps in intron unless we are
703 * preserving gaps in both exon and intron. Ignore them anyway if the
704 * protein alignment introduces a gap at least as large as the intronic
707 if (inExon && !preserveMappedGaps)
709 trailingGapLength = 0;
711 if (!inExon && !(preserveMappedGaps && preserveUnmappedGaps))
713 trailingGapLength = 0;
717 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
721 if (intronLength + trailingGapLength <= sourceGapMappedLength)
723 gapsToAdd = sourceGapMappedLength - intronLength;
727 gapsToAdd = Math.min(intronLength + trailingGapLength
728 - sourceGapMappedLength, trailingGapLength);
735 * second or third base of codon; check for any gaps in dna
737 if (!preserveMappedGaps)
739 trailingGapLength = 0;
741 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
747 * Returns a list of sequences mapped from the given sequences and aligned
748 * (gapped) in the same way. For example, the cDNA for aligned protein, where
749 * a single gap in protein generates three gaps in cDNA.
752 * @param gapCharacter
756 public static List<SequenceI> getAlignedTranslation(
757 List<SequenceI> sequences, char gapCharacter,
758 Set<AlignedCodonFrame> mappings)
760 List<SequenceI> alignedSeqs = new ArrayList<SequenceI>();
762 for (SequenceI seq : sequences)
764 List<SequenceI> mapped = getAlignedTranslation(seq, gapCharacter,
766 alignedSeqs.addAll(mapped);
772 * Returns sequences aligned 'like' the source sequence, as mapped by the
773 * given mappings. Normally we expect zero or one 'mapped' sequences, but this
774 * will support 1-to-many as well.
777 * @param gapCharacter
781 protected static List<SequenceI> getAlignedTranslation(SequenceI seq,
782 char gapCharacter, Set<AlignedCodonFrame> mappings)
784 List<SequenceI> result = new ArrayList<SequenceI>();
785 for (AlignedCodonFrame mapping : mappings)
787 if (mapping.involvesSequence(seq))
789 SequenceI mapped = getAlignedTranslation(seq, gapCharacter, mapping);
800 * Returns the translation of 'seq' (as held in the mapping) with
801 * corresponding alignment (gaps).
804 * @param gapCharacter
808 protected static SequenceI getAlignedTranslation(SequenceI seq,
809 char gapCharacter, AlignedCodonFrame mapping)
811 String gap = String.valueOf(gapCharacter);
812 boolean toDna = false;
814 SequenceI mapTo = mapping.getDnaForAaSeq(seq);
817 // mapping is from protein to nucleotide
819 // should ideally get gap count ratio from mapping
820 gap = String.valueOf(new char[] { gapCharacter, gapCharacter,
825 // mapping is from nucleotide to protein
826 mapTo = mapping.getAaForDnaSeq(seq);
829 StringBuilder newseq = new StringBuilder(seq.getLength()
832 int residueNo = 0; // in seq, base 1
833 int[] phrase = new int[fromRatio];
834 int phraseOffset = 0;
836 boolean first = true;
837 final Sequence alignedSeq = new Sequence("", "");
839 for (char c : seq.getSequence())
841 if (c == gapCharacter)
844 if (gapWidth >= fromRatio)
852 phrase[phraseOffset++] = residueNo + 1;
853 if (phraseOffset == fromRatio)
856 * Have read a whole codon (or protein residue), now translate: map
857 * source phrase to positions in target sequence add characters at
858 * these positions to newseq Note mapping positions are base 1, our
859 * sequence positions base 0.
861 SearchResults sr = new SearchResults();
862 for (int pos : phrase)
864 mapping.markMappedRegion(seq, pos, sr);
866 newseq.append(sr.getCharacters());
870 // Hack: Copy sequence dataset, name and description from
871 // SearchResults.match[0].sequence
872 // TODO? carry over sequence names from original 'complement'
874 SequenceI mappedTo = sr.getResultSequence(0);
875 alignedSeq.setName(mappedTo.getName());
876 alignedSeq.setDescription(mappedTo.getDescription());
877 alignedSeq.setDatasetSequence(mappedTo);
884 alignedSeq.setSequence(newseq.toString());
889 * Realigns the given protein to match the alignment of the dna, using codon
890 * mappings to translate aligned codon positions to protein residues.
893 * the alignment whose sequences are realigned by this method
895 * the dna alignment whose alignment we are 'copying'
896 * @return the number of sequences that were realigned
898 public static int alignProteinAsDna(AlignmentI protein, AlignmentI dna)
900 List<SequenceI> unmappedProtein = new ArrayList<SequenceI>();
901 unmappedProtein.addAll(protein.getSequences());
903 Set<AlignedCodonFrame> mappings = protein.getCodonFrames();
906 * Map will hold, for each aligned codon position e.g. [3, 5, 6], a map of
907 * {dnaSequence, {proteinSequence, codonProduct}} at that position. The
908 * comparator keeps the codon positions ordered.
910 Map<AlignedCodon, Map<SequenceI, String>> alignedCodons = new TreeMap<AlignedCodon, Map<SequenceI, String>>(
911 new CodonComparator());
912 for (SequenceI dnaSeq : dna.getSequences())
914 for (AlignedCodonFrame mapping : mappings)
916 Mapping seqMap = mapping.getMappingForSequence(dnaSeq);
917 SequenceI prot = mapping.findAlignedSequence(
918 dnaSeq.getDatasetSequence(), protein);
921 addCodonPositions(dnaSeq, prot, protein.getGapCharacter(),
922 seqMap, alignedCodons);
923 unmappedProtein.remove(prot);
927 return alignProteinAs(protein, alignedCodons, unmappedProtein);
931 * Update the aligned protein sequences to match the codon alignments given in
935 * @param alignedCodons
936 * an ordered map of codon positions (columns), with sequence/peptide
937 * values present in each column
938 * @param unmappedProtein
941 protected static int alignProteinAs(AlignmentI protein,
942 Map<AlignedCodon, Map<SequenceI, String>> alignedCodons,
943 List<SequenceI> unmappedProtein)
946 * Prefill aligned sequences with gaps before inserting aligned protein
949 int alignedWidth = alignedCodons.size();
950 char[] gaps = new char[alignedWidth];
951 Arrays.fill(gaps, protein.getGapCharacter());
952 String allGaps = String.valueOf(gaps);
953 for (SequenceI seq : protein.getSequences())
955 if (!unmappedProtein.contains(seq))
957 seq.setSequence(allGaps);
962 for (AlignedCodon codon : alignedCodons.keySet())
964 final Map<SequenceI, String> columnResidues = alignedCodons
966 for (Entry<SequenceI, String> entry : columnResidues.entrySet())
968 // place translated codon at its column position in sequence
969 entry.getKey().getSequence()[column] = entry.getValue().charAt(0);
977 * Populate the map of aligned codons by traversing the given sequence
978 * mapping, locating the aligned positions of mapped codons, and adding those
979 * positions and their translation products to the map.
982 * the aligned sequence we are mapping from
984 * the sequence to be aligned to the codons
986 * the gap character in the dna sequence
988 * a mapping to a sequence translation
989 * @param alignedCodons
990 * the map we are building up
992 static void addCodonPositions(SequenceI dna, SequenceI protein,
993 char gapChar, Mapping seqMap,
994 Map<AlignedCodon, Map<SequenceI, String>> alignedCodons)
996 Iterator<AlignedCodon> codons = seqMap.getCodonIterator(dna, gapChar);
997 while (codons.hasNext())
999 AlignedCodon codon = codons.next();
1000 Map<SequenceI, String> seqProduct = alignedCodons.get(codon);
1001 if (seqProduct == null)
1003 seqProduct = new HashMap<SequenceI, String>();
1004 alignedCodons.put(codon, seqProduct);
1006 seqProduct.put(protein, codon.product);
1011 * Returns true if a cDNA/Protein mapping either exists, or could be made,
1012 * between at least one pair of sequences in the two alignments. Currently,
1015 * <li>One alignment must be nucleotide, and the other protein</li>
1016 * <li>At least one pair of sequences must be already mapped, or mappable</li>
1017 * <li>Mappable means the nucleotide translation matches the protein sequence</li>
1018 * <li>The translation may ignore start and stop codons if present in the
1026 public static boolean isMappable(AlignmentI al1, AlignmentI al2)
1028 if (al1 == null || al2 == null)
1034 * Require one nucleotide and one protein
1036 if (al1.isNucleotide() == al2.isNucleotide())
1040 AlignmentI dna = al1.isNucleotide() ? al1 : al2;
1041 AlignmentI protein = dna == al1 ? al2 : al1;
1042 Set<AlignedCodonFrame> mappings = protein.getCodonFrames();
1043 for (SequenceI dnaSeq : dna.getSequences())
1045 for (SequenceI proteinSeq : protein.getSequences())
1047 if (isMappable(dnaSeq, proteinSeq, mappings))
1057 * Returns true if the dna sequence is mapped, or could be mapped, to the
1065 protected static boolean isMappable(SequenceI dnaSeq,
1066 SequenceI proteinSeq, Set<AlignedCodonFrame> mappings)
1068 if (dnaSeq == null || proteinSeq == null)
1073 SequenceI dnaDs = dnaSeq.getDatasetSequence() == null ? dnaSeq : dnaSeq
1074 .getDatasetSequence();
1075 SequenceI proteinDs = proteinSeq.getDatasetSequence() == null ? proteinSeq
1076 : proteinSeq.getDatasetSequence();
1081 for (AlignedCodonFrame mapping : mappings)
1083 if (proteinDs == mapping.getAaForDnaSeq(dnaDs))
1090 * Just try to make a mapping (it is not yet stored), test whether
1093 return mapProteinToCdna(proteinDs, dnaDs) != null;
1097 * Finds any reference annotations associated with the sequences in
1098 * sequenceScope, that are not already added to the alignment, and adds them
1099 * to the 'candidates' map. Also populates a lookup table of annotation
1100 * labels, keyed by calcId, for use in constructing tooltips or the like.
1102 * @param sequenceScope
1103 * the sequences to scan for reference annotations
1104 * @param labelForCalcId
1105 * (optional) map to populate with label for calcId
1107 * map to populate with annotations for sequence
1109 * the alignment to check for presence of annotations
1111 public static void findAddableReferenceAnnotations(
1112 List<SequenceI> sequenceScope,
1113 Map<String, String> labelForCalcId,
1114 final Map<SequenceI, List<AlignmentAnnotation>> candidates,
1117 if (sequenceScope == null)
1123 * For each sequence in scope, make a list of any annotations on the
1124 * underlying dataset sequence which are not already on the alignment.
1126 * Add to a map of { alignmentSequence, <List of annotations to add> }
1128 for (SequenceI seq : sequenceScope)
1130 SequenceI dataset = seq.getDatasetSequence();
1131 if (dataset == null)
1135 AlignmentAnnotation[] datasetAnnotations = dataset.getAnnotation();
1136 if (datasetAnnotations == null)
1140 final List<AlignmentAnnotation> result = new ArrayList<AlignmentAnnotation>();
1141 for (AlignmentAnnotation dsann : datasetAnnotations)
1144 * Find matching annotations on the alignment. If none is found, then
1145 * add this annotation to the list of 'addable' annotations for this
1148 final Iterable<AlignmentAnnotation> matchedAlignmentAnnotations = al
1149 .findAnnotations(seq, dsann.getCalcId(), dsann.label);
1150 if (!matchedAlignmentAnnotations.iterator().hasNext())
1153 if (labelForCalcId != null)
1155 labelForCalcId.put(dsann.getCalcId(), dsann.label);
1160 * Save any addable annotations for this sequence
1162 if (!result.isEmpty())
1164 candidates.put(seq, result);
1170 * Adds annotations to the top of the alignment annotations, in the same order
1171 * as their related sequences.
1173 * @param annotations
1174 * the annotations to add
1176 * the alignment to add them to
1177 * @param selectionGroup
1178 * current selection group (or null if none)
1180 public static void addReferenceAnnotations(
1181 Map<SequenceI, List<AlignmentAnnotation>> annotations,
1182 final AlignmentI alignment, final SequenceGroup selectionGroup)
1184 for (SequenceI seq : annotations.keySet())
1186 for (AlignmentAnnotation ann : annotations.get(seq))
1188 AlignmentAnnotation copyAnn = new AlignmentAnnotation(ann);
1190 int endRes = ann.annotations.length;
1191 if (selectionGroup != null)
1193 startRes = selectionGroup.getStartRes();
1194 endRes = selectionGroup.getEndRes();
1196 copyAnn.restrict(startRes, endRes);
1199 * Add to the sequence (sets copyAnn.datasetSequence), unless the
1200 * original annotation is already on the sequence.
1202 if (!seq.hasAnnotation(ann))
1204 seq.addAlignmentAnnotation(copyAnn);
1207 copyAnn.adjustForAlignment();
1208 // add to the alignment and set visible
1209 alignment.addAnnotation(copyAnn);
1210 copyAnn.visible = true;
1216 * Set visibility of alignment annotations of specified types (labels), for
1217 * specified sequences. This supports controls like
1218 * "Show all secondary structure", "Hide all Temp factor", etc.
1220 * @al the alignment to scan for annotations
1222 * the types (labels) of annotations to be updated
1223 * @param forSequences
1224 * if not null, only annotations linked to one of these sequences are
1225 * in scope for update; if null, acts on all sequence annotations
1227 * if this flag is true, 'types' is ignored (label not checked)
1229 * if true, set visibility on, else set off
1231 public static void showOrHideSequenceAnnotations(AlignmentI al,
1232 Collection<String> types, List<SequenceI> forSequences,
1233 boolean anyType, boolean doShow)
1235 for (AlignmentAnnotation aa : al.getAlignmentAnnotation())
1237 if (anyType || types.contains(aa.label))
1239 if ((aa.sequenceRef != null)
1240 && (forSequences == null || forSequences
1241 .contains(aa.sequenceRef)))
1243 aa.visible = doShow;
1250 * Returns true if either sequence has a cross-reference to the other
1256 public static boolean haveCrossRef(SequenceI seq1, SequenceI seq2)
1258 // Note: moved here from class CrossRef as the latter class has dependencies
1259 // not availability to the applet's classpath
1260 return hasCrossRef(seq1, seq2) || hasCrossRef(seq2, seq1);
1264 * Returns true if seq1 has a cross-reference to seq2. Currently this assumes
1265 * that sequence name is structured as Source|AccessionId.
1271 public static boolean hasCrossRef(SequenceI seq1, SequenceI seq2)
1273 if (seq1 == null || seq2 == null)
1277 String name = seq2.getName();
1278 final DBRefEntry[] xrefs = seq1.getDBRef();
1281 for (DBRefEntry xref : xrefs)
1283 String xrefName = xref.getSource() + "|" + xref.getAccessionId();
1284 // case-insensitive test, consistent with DBRefEntry.equalRef()
1285 if (xrefName.equalsIgnoreCase(name))
1295 * Constructs an alignment consisting of the mapped exon regions in the given
1296 * nucleotide sequences, and updates mappings to match.
1299 * aligned dna sequences
1301 * from dna to protein; these are replaced with new mappings
1302 * @return an alignment whose sequences are the exon-only parts of the dna
1303 * sequences (or null if no exons are found)
1305 public static AlignmentI makeExonAlignment(SequenceI[] dna,
1306 Set<AlignedCodonFrame> mappings)
1308 Set<AlignedCodonFrame> newMappings = new LinkedHashSet<AlignedCodonFrame>();
1309 List<SequenceI> exonSequences = new ArrayList<SequenceI>();
1311 for (SequenceI dnaSeq : dna)
1313 final SequenceI ds = dnaSeq.getDatasetSequence();
1314 List<AlignedCodonFrame> seqMappings = MappingUtils
1315 .findMappingsForSequence(ds, mappings);
1316 for (AlignedCodonFrame acf : seqMappings)
1318 AlignedCodonFrame newMapping = new AlignedCodonFrame();
1319 final List<SequenceI> mappedExons = makeExonSequences(ds, acf,
1321 if (!mappedExons.isEmpty())
1323 exonSequences.addAll(mappedExons);
1324 newMappings.add(newMapping);
1328 AlignmentI al = new Alignment(
1329 exonSequences.toArray(new SequenceI[exonSequences.size()]));
1330 al.setDataset(null);
1333 * Replace the old mappings with the new ones
1336 mappings.addAll(newMappings);
1342 * Helper method to make exon-only sequences and populate their mappings to
1345 * For example, if ggCCaTTcGAg has mappings [3, 4, 6, 7, 9, 10] to protein
1346 * then generate a sequence CCTTGA with mapping [1, 6] to the same protein
1349 * Typically eukaryotic dna will include exons encoding for a single peptide
1350 * sequence i.e. return a single result. Bacterial dna may have overlapping
1351 * exon mappings coding for multiple peptides so return multiple results
1352 * (example EMBL KF591215).
1355 * a dna dataset sequence
1357 * containing one or more mappings of the sequence to protein
1359 * the new mapping to populate, from the exon-only sequences to their
1360 * mapped protein sequences
1363 protected static List<SequenceI> makeExonSequences(SequenceI dnaSeq,
1364 AlignedCodonFrame mapping, AlignedCodonFrame newMapping)
1366 List<SequenceI> exonSequences = new ArrayList<SequenceI>();
1367 List<Mapping> seqMappings = mapping.getMappingsForSequence(dnaSeq);
1368 final char[] dna = dnaSeq.getSequence();
1369 for (Mapping seqMapping : seqMappings)
1371 StringBuilder newSequence = new StringBuilder(dnaSeq.getLength());
1374 * Get the codon regions as { [2, 5], [7, 12], [14, 14] etc }
1376 final List<int[]> dnaExonRanges = seqMapping.getMap().getFromRanges();
1377 for (int[] range : dnaExonRanges)
1379 for (int pos = range[0]; pos <= range[1]; pos++)
1381 newSequence.append(dna[pos - 1]);
1385 SequenceI exon = new Sequence(dnaSeq.getName(),
1386 newSequence.toString());
1389 * Locate any xrefs to CDS database on the protein product and attach to
1390 * the CDS sequence. Also add as a sub-token of the sequence name.
1392 // default to "CDS" if we can't locate an actual gene id
1393 String cdsAccId = FeatureProperties
1394 .getCodingFeature(DBRefSource.EMBL);
1395 DBRefEntry[] cdsRefs = DBRefUtils.selectRefs(seqMapping.getTo()
1396 .getDBRef(), DBRefSource.CODINGDBS);
1397 if (cdsRefs != null)
1399 for (DBRefEntry cdsRef : cdsRefs)
1401 exon.addDBRef(new DBRefEntry(cdsRef));
1402 cdsAccId = cdsRef.getAccessionId();
1405 exon.setName(exon.getName() + "|" + cdsAccId);
1406 exon.createDatasetSequence();
1409 * Build new mappings - from the same protein regions, but now to
1412 List<int[]> exonRange = new ArrayList<int[]>();
1413 exonRange.add(new int[] { 1, newSequence.length() });
1414 MapList map = new MapList(exonRange, seqMapping.getMap()
1415 .getToRanges(), 3, 1);
1416 newMapping.addMap(exon.getDatasetSequence(), seqMapping.getTo(), map);
1417 MapList cdsToDnaMap = new MapList(dnaExonRanges, exonRange, 1, 1);
1418 newMapping.addMap(dnaSeq, exon.getDatasetSequence(), cdsToDnaMap);
1420 exonSequences.add(exon);
1422 return exonSequences;