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.analysis;
23 import java.util.ArrayList;
24 import java.util.Arrays;
25 import java.util.Collection;
26 import java.util.Collections;
27 import java.util.HashMap;
28 import java.util.HashSet;
29 import java.util.Iterator;
30 import java.util.LinkedHashMap;
31 import java.util.List;
32 import java.util.Locale;
34 import java.util.Map.Entry;
35 import java.util.NoSuchElementException;
37 import java.util.SortedMap;
38 import java.util.TreeMap;
40 import jalview.bin.Console;
41 import jalview.commands.RemoveGapColCommand;
42 import jalview.datamodel.AlignedCodon;
43 import jalview.datamodel.AlignedCodonFrame;
44 import jalview.datamodel.AlignedCodonFrame.SequenceToSequenceMapping;
45 import jalview.datamodel.Alignment;
46 import jalview.datamodel.AlignmentAnnotation;
47 import jalview.datamodel.AlignmentI;
48 import jalview.datamodel.ContactMatrixI;
49 import jalview.datamodel.DBRefEntry;
50 import jalview.datamodel.GeneLociI;
51 import jalview.datamodel.IncompleteCodonException;
52 import jalview.datamodel.Mapping;
53 import jalview.datamodel.Sequence;
54 import jalview.datamodel.SequenceFeature;
55 import jalview.datamodel.SequenceGroup;
56 import jalview.datamodel.SequenceI;
57 import jalview.datamodel.features.SequenceFeatures;
58 import jalview.io.gff.SequenceOntologyI;
59 import jalview.schemes.ResidueProperties;
60 import jalview.util.Comparison;
61 import jalview.util.DBRefUtils;
62 import jalview.util.IntRangeComparator;
63 import jalview.util.MapList;
64 import jalview.util.MappingUtils;
67 * grab bag of useful alignment manipulation operations Expect these to be
68 * refactored elsewhere at some point.
73 public class AlignmentUtils
75 private static final int CODON_LENGTH = 3;
77 private static final String SEQUENCE_VARIANT = "sequence_variant:";
80 * the 'id' attribute is provided for variant features fetched from
81 * Ensembl using its REST service with JSON format
83 public static final String VARIANT_ID = "id";
86 * A data model to hold the 'normal' base value at a position, and an optional
87 * sequence variant feature
89 static final class DnaVariant
93 SequenceFeature variant;
95 DnaVariant(String nuc)
101 DnaVariant(String nuc, SequenceFeature var)
107 public String getSource()
109 return variant == null ? null : variant.getFeatureGroup();
113 * toString for aid in the debugger only
116 public String toString()
118 return base + ":" + (variant == null ? "" : variant.getDescription());
123 * given an existing alignment, create a new alignment including all, or up to
124 * flankSize additional symbols from each sequence's dataset sequence
130 public static AlignmentI expandContext(AlignmentI core, int flankSize)
132 List<SequenceI> sq = new ArrayList<>();
134 for (SequenceI s : core.getSequences())
136 SequenceI newSeq = s.deriveSequence();
137 final int newSeqStart = newSeq.getStart() - 1;
138 if (newSeqStart > maxoffset
139 && newSeq.getDatasetSequence().getStart() < s.getStart())
141 maxoffset = newSeqStart;
147 maxoffset = Math.min(maxoffset, flankSize);
151 * now add offset left and right to create an expanded alignment
153 for (SequenceI s : sq)
156 while (ds.getDatasetSequence() != null)
158 ds = ds.getDatasetSequence();
160 int s_end = s.findPosition(s.getStart() + s.getLength());
161 // find available flanking residues for sequence
162 int ustream_ds = s.getStart() - ds.getStart();
163 int dstream_ds = ds.getEnd() - s_end;
165 // build new flanked sequence
167 // compute gap padding to start of flanking sequence
168 int offset = maxoffset - ustream_ds;
170 // padding is gapChar x ( maxoffset - min(ustream_ds, flank)
173 if (flankSize < ustream_ds)
175 // take up to flankSize residues
176 offset = maxoffset - flankSize;
177 ustream_ds = flankSize;
179 if (flankSize <= dstream_ds)
181 dstream_ds = flankSize - 1;
184 // TODO use Character.toLowerCase to avoid creating String objects?
185 char[] upstream = new String(ds
186 .getSequence(s.getStart() - 1 - ustream_ds, s.getStart() - 1))
187 .toLowerCase(Locale.ROOT).toCharArray();
188 char[] downstream = new String(
189 ds.getSequence(s_end - 1, s_end + dstream_ds))
190 .toLowerCase(Locale.ROOT).toCharArray();
191 char[] coreseq = s.getSequence();
192 char[] nseq = new char[offset + upstream.length + downstream.length
194 char c = core.getGapCharacter();
197 for (; p < offset; p++)
202 System.arraycopy(upstream, 0, nseq, p, upstream.length);
203 System.arraycopy(coreseq, 0, nseq, p + upstream.length,
205 System.arraycopy(downstream, 0, nseq,
206 p + coreseq.length + upstream.length, downstream.length);
207 s.setSequence(new String(nseq));
208 s.setStart(s.getStart() - ustream_ds);
209 s.setEnd(s_end + downstream.length);
211 AlignmentI newAl = new jalview.datamodel.Alignment(
212 sq.toArray(new SequenceI[0]));
213 for (SequenceI s : sq)
215 if (s.getAnnotation() != null)
217 for (AlignmentAnnotation aa : s.getAnnotation())
219 aa.adjustForAlignment(); // JAL-1712 fix
220 newAl.addAnnotation(aa);
224 newAl.setDataset(core.getDataset());
229 * Returns the index (zero-based position) of a sequence in an alignment, or
236 public static int getSequenceIndex(AlignmentI al, SequenceI seq)
240 for (SequenceI alSeq : al.getSequences())
253 * Returns a map of lists of sequences in the alignment, keyed by sequence
254 * name. For use in mapping between different alignment views of the same
257 * @see jalview.datamodel.AlignmentI#getSequencesByName()
259 public static Map<String, List<SequenceI>> getSequencesByName(
262 Map<String, List<SequenceI>> theMap = new LinkedHashMap<>();
263 for (SequenceI seq : al.getSequences())
265 String name = seq.getName();
268 List<SequenceI> seqs = theMap.get(name);
271 seqs = new ArrayList<>();
272 theMap.put(name, seqs);
281 * Build mapping of protein to cDNA alignment. Mappings are made between
282 * sequences where the cDNA translates to the protein sequence. Any new
283 * mappings are added to the protein alignment. Returns true if any mappings
284 * either already exist or were added, else false.
286 * @param proteinAlignment
287 * @param cdnaAlignment
290 public static boolean mapProteinAlignmentToCdna(
291 final AlignmentI proteinAlignment, final AlignmentI cdnaAlignment)
293 if (proteinAlignment == null || cdnaAlignment == null)
298 Set<SequenceI> mappedDna = new HashSet<>();
299 Set<SequenceI> mappedProtein = new HashSet<>();
302 * First pass - map sequences where cross-references exist. This include
303 * 1-to-many mappings to support, for example, variant cDNA.
305 boolean mappingPerformed = mapProteinToCdna(proteinAlignment,
306 cdnaAlignment, mappedDna, mappedProtein, true);
309 * Second pass - map sequences where no cross-references exist. This only
310 * does 1-to-1 mappings and assumes corresponding sequences are in the same
311 * order in the alignments.
313 mappingPerformed |= mapProteinToCdna(proteinAlignment, cdnaAlignment,
314 mappedDna, mappedProtein, false);
315 return mappingPerformed;
319 * Make mappings between compatible sequences (where the cDNA translation
320 * matches the protein).
322 * @param proteinAlignment
323 * @param cdnaAlignment
325 * a set of mapped DNA sequences (to add to)
326 * @param mappedProtein
327 * a set of mapped Protein sequences (to add to)
329 * if true, only map sequences where xrefs exist
332 protected static boolean mapProteinToCdna(
333 final AlignmentI proteinAlignment, final AlignmentI cdnaAlignment,
334 Set<SequenceI> mappedDna, Set<SequenceI> mappedProtein,
337 boolean mappingExistsOrAdded = false;
338 List<SequenceI> thisSeqs = proteinAlignment.getSequences();
339 for (SequenceI aaSeq : thisSeqs)
341 boolean proteinMapped = false;
342 AlignedCodonFrame acf = new AlignedCodonFrame();
344 for (SequenceI cdnaSeq : cdnaAlignment.getSequences())
347 * Always try to map if sequences have xref to each other; this supports
348 * variant cDNA or alternative splicing for a protein sequence.
350 * If no xrefs, try to map progressively, assuming that alignments have
351 * mappable sequences in corresponding order. These are not
352 * many-to-many, as that would risk mixing species with similar cDNA
355 if (xrefsOnly && !AlignmentUtils.haveCrossRef(aaSeq, cdnaSeq))
361 * Don't map non-xrefd sequences more than once each. This heuristic
362 * allows us to pair up similar sequences in ordered alignments.
364 if (!xrefsOnly && (mappedProtein.contains(aaSeq)
365 || mappedDna.contains(cdnaSeq)))
369 if (mappingExists(proteinAlignment.getCodonFrames(),
370 aaSeq.getDatasetSequence(), cdnaSeq.getDatasetSequence()))
372 mappingExistsOrAdded = true;
376 MapList map = mapCdnaToProtein(aaSeq, cdnaSeq);
379 acf.addMap(cdnaSeq, aaSeq, map);
380 mappingExistsOrAdded = true;
381 proteinMapped = true;
382 mappedDna.add(cdnaSeq);
383 mappedProtein.add(aaSeq);
389 proteinAlignment.addCodonFrame(acf);
392 return mappingExistsOrAdded;
396 * Answers true if the mappings include one between the given (dataset)
399 protected static boolean mappingExists(List<AlignedCodonFrame> mappings,
400 SequenceI aaSeq, SequenceI cdnaSeq)
402 if (mappings != null)
404 for (AlignedCodonFrame acf : mappings)
406 if (cdnaSeq == acf.getDnaForAaSeq(aaSeq))
416 * Builds a mapping (if possible) of a cDNA to a protein sequence.
418 * <li>first checks if the cdna translates exactly to the protein
420 * <li>else checks for translation after removing a STOP codon</li>
421 * <li>else checks for translation after removing a START codon</li>
422 * <li>if that fails, inspect CDS features on the cDNA sequence</li>
424 * Returns null if no mapping is determined.
427 * the aligned protein sequence
429 * the aligned cdna sequence
432 public static MapList mapCdnaToProtein(SequenceI proteinSeq,
436 * Here we handle either dataset sequence set (desktop) or absent (applet).
437 * Use only the char[] form of the sequence to avoid creating possibly large
440 final SequenceI proteinDataset = proteinSeq.getDatasetSequence();
441 char[] aaSeqChars = proteinDataset != null
442 ? proteinDataset.getSequence()
443 : proteinSeq.getSequence();
444 final SequenceI cdnaDataset = cdnaSeq.getDatasetSequence();
445 char[] cdnaSeqChars = cdnaDataset != null ? cdnaDataset.getSequence()
446 : cdnaSeq.getSequence();
447 if (aaSeqChars == null || cdnaSeqChars == null)
453 * cdnaStart/End, proteinStartEnd are base 1 (for dataset sequence mapping)
455 final int mappedLength = CODON_LENGTH * aaSeqChars.length;
456 int cdnaLength = cdnaSeqChars.length;
457 int cdnaStart = cdnaSeq.getStart();
458 int cdnaEnd = cdnaSeq.getEnd();
459 final int proteinStart = proteinSeq.getStart();
460 final int proteinEnd = proteinSeq.getEnd();
463 * If lengths don't match, try ignoring stop codon (if present)
465 if (cdnaLength != mappedLength && cdnaLength > 2)
467 String lastCodon = String.valueOf(cdnaSeqChars,
468 cdnaLength - CODON_LENGTH, CODON_LENGTH)
469 .toUpperCase(Locale.ROOT);
470 for (String stop : ResidueProperties.STOP_CODONS)
472 if (lastCodon.equals(stop))
474 cdnaEnd -= CODON_LENGTH;
475 cdnaLength -= CODON_LENGTH;
482 * If lengths still don't match, try ignoring start codon.
485 if (cdnaLength != mappedLength && cdnaLength > 2
486 && String.valueOf(cdnaSeqChars, 0, CODON_LENGTH)
487 .toUpperCase(Locale.ROOT)
488 .equals(ResidueProperties.START))
490 startOffset += CODON_LENGTH;
491 cdnaStart += CODON_LENGTH;
492 cdnaLength -= CODON_LENGTH;
495 if (translatesAs(cdnaSeqChars, startOffset, aaSeqChars))
498 * protein is translation of dna (+/- start/stop codons)
500 MapList map = new MapList(new int[] { cdnaStart, cdnaEnd },
502 { proteinStart, proteinEnd }, CODON_LENGTH, 1);
507 * translation failed - try mapping CDS annotated regions of dna
509 return mapCdsToProtein(cdnaSeq, proteinSeq);
513 * Test whether the given cdna sequence, starting at the given offset,
514 * translates to the given amino acid sequence, using the standard translation
515 * table. Designed to fail fast i.e. as soon as a mismatch position is found.
517 * @param cdnaSeqChars
522 protected static boolean translatesAs(char[] cdnaSeqChars, int cdnaStart,
525 if (cdnaSeqChars == null || aaSeqChars == null)
531 int dnaPos = cdnaStart;
532 for (; dnaPos < cdnaSeqChars.length - 2
533 && aaPos < aaSeqChars.length; dnaPos += CODON_LENGTH, aaPos++)
535 String codon = String.valueOf(cdnaSeqChars, dnaPos, CODON_LENGTH);
536 final String translated = ResidueProperties.codonTranslate(codon);
539 * allow * in protein to match untranslatable in dna
541 final char aaRes = aaSeqChars[aaPos];
542 if ((translated == null || ResidueProperties.STOP.equals(translated))
547 if (translated == null || !(aaRes == translated.charAt(0)))
550 // jalview.bin.Console.outPrintln(("Mismatch at " + i + "/" + aaResidue
552 // + codon + "(" + translated + ") != " + aaRes));
558 * check we matched all of the protein sequence
560 if (aaPos != aaSeqChars.length)
566 * check we matched all of the dna except
567 * for optional trailing STOP codon
569 if (dnaPos == cdnaSeqChars.length)
573 if (dnaPos == cdnaSeqChars.length - CODON_LENGTH)
575 String codon = String.valueOf(cdnaSeqChars, dnaPos, CODON_LENGTH);
576 if (ResidueProperties.STOP
577 .equals(ResidueProperties.codonTranslate(codon)))
586 * Align sequence 'seq' to match the alignment of a mapped sequence. Note this
587 * currently assumes that we are aligning cDNA to match protein.
590 * the sequence to be realigned
592 * the alignment whose sequence alignment is to be 'copied'
594 * character string represent a gap in the realigned sequence
595 * @param preserveUnmappedGaps
596 * @param preserveMappedGaps
597 * @return true if the sequence was realigned, false if it could not be
599 public static boolean alignSequenceAs(SequenceI seq, AlignmentI al,
600 String gap, boolean preserveMappedGaps,
601 boolean preserveUnmappedGaps)
604 * Get any mappings from the source alignment to the target (dataset)
607 // TODO there may be one AlignedCodonFrame per dataset sequence, or one with
608 // all mappings. Would it help to constrain this?
609 List<AlignedCodonFrame> mappings = al.getCodonFrame(seq);
610 if (mappings == null || mappings.isEmpty())
616 * Locate the aligned source sequence whose dataset sequence is mapped. We
617 * just take the first match here (as we can't align like more than one
620 SequenceI alignFrom = null;
621 AlignedCodonFrame mapping = null;
622 for (AlignedCodonFrame mp : mappings)
624 alignFrom = mp.findAlignedSequence(seq, al);
625 if (alignFrom != null)
632 if (alignFrom == null)
636 alignSequenceAs(seq, alignFrom, mapping, gap, al.getGapCharacter(),
637 preserveMappedGaps, preserveUnmappedGaps);
642 * Align sequence 'alignTo' the same way as 'alignFrom', using the mapping to
643 * match residues and codons. Flags control whether existing gaps in unmapped
644 * (intron) and mapped (exon) regions are preserved or not. Gaps between
645 * intron and exon are only retained if both flags are set.
652 * @param preserveUnmappedGaps
653 * @param preserveMappedGaps
655 public static void alignSequenceAs(SequenceI alignTo, SequenceI alignFrom,
656 AlignedCodonFrame mapping, String myGap, char sourceGap,
657 boolean preserveMappedGaps, boolean preserveUnmappedGaps)
659 // TODO generalise to work for Protein-Protein, dna-dna, dna-protein
661 // aligned and dataset sequence positions, all base zero
665 int basesWritten = 0;
666 char myGapChar = myGap.charAt(0);
667 int ratio = myGap.length();
669 int fromOffset = alignFrom.getStart() - 1;
670 int toOffset = alignTo.getStart() - 1;
671 int sourceGapMappedLength = 0;
672 boolean inExon = false;
673 final int toLength = alignTo.getLength();
674 final int fromLength = alignFrom.getLength();
675 StringBuilder thisAligned = new StringBuilder(2 * toLength);
678 * Traverse the 'model' aligned sequence
680 for (int i = 0; i < fromLength; i++)
682 char sourceChar = alignFrom.getCharAt(i);
683 if (sourceChar == sourceGap)
685 sourceGapMappedLength += ratio;
690 * Found a non-gap character. Locate its mapped region if any.
693 // Note mapping positions are base 1, our sequence positions base 0
694 int[] mappedPos = mapping.getMappedRegion(alignTo, alignFrom,
695 sourceDsPos + fromOffset);
696 if (mappedPos == null)
699 * unmapped position; treat like a gap
701 sourceGapMappedLength += ratio;
702 // jalview.bin.Console.errPrintln("Can't align: no codon mapping to
704 // + sourceDsPos + "(" + sourceChar + ")");
709 int mappedCodonStart = mappedPos[0]; // position (1...) of codon start
710 int mappedCodonEnd = mappedPos[mappedPos.length - 1]; // codon end pos
711 StringBuilder trailingCopiedGap = new StringBuilder();
714 * Copy dna sequence up to and including this codon. Optionally, include
715 * gaps before the codon starts (in introns) and/or after the codon starts
718 * Note this only works for 'linear' splicing, not reverse or interleaved.
719 * But then 'align dna as protein' doesn't make much sense otherwise.
721 int intronLength = 0;
722 while (basesWritten + toOffset < mappedCodonEnd
723 && thisSeqPos < toLength)
725 final char c = alignTo.getCharAt(thisSeqPos++);
729 int sourcePosition = basesWritten + toOffset;
730 if (sourcePosition < mappedCodonStart)
733 * Found an unmapped (intron) base. First add in any preceding gaps
736 if (preserveUnmappedGaps && trailingCopiedGap.length() > 0)
738 thisAligned.append(trailingCopiedGap.toString());
739 intronLength += trailingCopiedGap.length();
740 trailingCopiedGap = new StringBuilder();
747 final boolean startOfCodon = sourcePosition == mappedCodonStart;
748 int gapsToAdd = calculateGapsToInsert(preserveMappedGaps,
749 preserveUnmappedGaps, sourceGapMappedLength, inExon,
750 trailingCopiedGap.length(), intronLength, startOfCodon);
751 for (int k = 0; k < gapsToAdd; k++)
753 thisAligned.append(myGapChar);
755 sourceGapMappedLength = 0;
758 thisAligned.append(c);
759 trailingCopiedGap = new StringBuilder();
763 if (inExon && preserveMappedGaps)
765 trailingCopiedGap.append(myGapChar);
767 else if (!inExon && preserveUnmappedGaps)
769 trailingCopiedGap.append(myGapChar);
776 * At end of model aligned sequence. Copy any remaining target sequence, optionally
777 * including (intron) gaps.
779 while (thisSeqPos < toLength)
781 final char c = alignTo.getCharAt(thisSeqPos++);
782 if (c != myGapChar || preserveUnmappedGaps)
784 thisAligned.append(c);
786 sourceGapMappedLength--;
790 * finally add gaps to pad for any trailing source gaps or
791 * unmapped characters
793 if (preserveUnmappedGaps)
795 while (sourceGapMappedLength > 0)
797 thisAligned.append(myGapChar);
798 sourceGapMappedLength--;
803 * All done aligning, set the aligned sequence.
805 alignTo.setSequence(new String(thisAligned));
809 * Helper method to work out how many gaps to insert when realigning.
811 * @param preserveMappedGaps
812 * @param preserveUnmappedGaps
813 * @param sourceGapMappedLength
815 * @param trailingCopiedGap
816 * @param intronLength
817 * @param startOfCodon
820 protected static int calculateGapsToInsert(boolean preserveMappedGaps,
821 boolean preserveUnmappedGaps, int sourceGapMappedLength,
822 boolean inExon, int trailingGapLength, int intronLength,
823 final boolean startOfCodon)
829 * Reached start of codon. Ignore trailing gaps in intron unless we are
830 * preserving gaps in both exon and intron. Ignore them anyway if the
831 * protein alignment introduces a gap at least as large as the intronic
834 if (inExon && !preserveMappedGaps)
836 trailingGapLength = 0;
838 if (!inExon && !(preserveMappedGaps && preserveUnmappedGaps))
840 trailingGapLength = 0;
844 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
848 if (intronLength + trailingGapLength <= sourceGapMappedLength)
850 gapsToAdd = sourceGapMappedLength - intronLength;
854 gapsToAdd = Math.min(
855 intronLength + trailingGapLength - sourceGapMappedLength,
863 * second or third base of codon; check for any gaps in dna
865 if (!preserveMappedGaps)
867 trailingGapLength = 0;
869 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
875 * Realigns the given protein to match the alignment of the dna, using codon
876 * mappings to translate aligned codon positions to protein residues.
879 * the alignment whose sequences are realigned by this method
881 * the dna alignment whose alignment we are 'copying'
882 * @return the number of sequences that were realigned
884 public static int alignProteinAsDna(AlignmentI protein, AlignmentI dna)
886 if (protein.isNucleotide() || !dna.isNucleotide())
889 .errPrintln("Wrong alignment type in alignProteinAsDna");
892 List<SequenceI> unmappedProtein = new ArrayList<>();
893 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons = buildCodonColumnsMap(
894 protein, dna, unmappedProtein);
895 return alignProteinAs(protein, alignedCodons, unmappedProtein);
899 * Realigns the given dna to match the alignment of the protein, using codon
900 * mappings to translate aligned peptide positions to codons.
902 * Always produces a padded CDS alignment.
905 * the alignment whose sequences are realigned by this method
907 * the protein alignment whose alignment we are 'copying'
908 * @return the number of sequences that were realigned
910 public static int alignCdsAsProtein(AlignmentI dna, AlignmentI protein)
912 if (protein.isNucleotide() || !dna.isNucleotide())
915 .errPrintln("Wrong alignment type in alignProteinAsDna");
918 // todo: implement this
919 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
920 int alignedCount = 0;
921 int width = 0; // alignment width for padding CDS
922 for (SequenceI dnaSeq : dna.getSequences())
924 if (alignCdsSequenceAsProtein(dnaSeq, protein, mappings,
925 dna.getGapCharacter()))
929 width = Math.max(dnaSeq.getLength(), width);
933 for (SequenceI dnaSeq : dna.getSequences())
935 oldwidth = dnaSeq.getLength();
936 diff = width - oldwidth;
939 dnaSeq.insertCharAt(oldwidth, diff, dna.getGapCharacter());
946 * Helper method to align (if possible) the dna sequence to match the
947 * alignment of a mapped protein sequence. This is currently limited to
948 * handling coding sequence only.
956 static boolean alignCdsSequenceAsProtein(SequenceI cdsSeq,
957 AlignmentI protein, List<AlignedCodonFrame> mappings,
960 SequenceI cdsDss = cdsSeq.getDatasetSequence();
964 .println("alignCdsSequenceAsProtein needs aligned sequence!");
968 List<AlignedCodonFrame> dnaMappings = MappingUtils
969 .findMappingsForSequence(cdsSeq, mappings);
970 for (AlignedCodonFrame mapping : dnaMappings)
972 SequenceI peptide = mapping.findAlignedSequence(cdsSeq, protein);
975 final int peptideLength = peptide.getLength();
976 Mapping map = mapping.getMappingBetween(cdsSeq, peptide);
979 MapList mapList = map.getMap();
980 if (map.getTo() == peptide.getDatasetSequence())
982 mapList = mapList.getInverse();
984 final int cdsLength = cdsDss.getLength();
985 int mappedFromLength = MappingUtils
986 .getLength(mapList.getFromRanges());
987 int mappedToLength = MappingUtils
988 .getLength(mapList.getToRanges());
989 boolean addStopCodon = (cdsLength == mappedFromLength
990 * CODON_LENGTH + CODON_LENGTH)
991 || (peptide.getDatasetSequence()
992 .getLength() == mappedFromLength - 1);
993 if (cdsLength != mappedToLength && !addStopCodon)
995 jalview.bin.Console.errPrintln(String.format(
996 "Can't align cds as protein (length mismatch %d/%d): %s",
997 cdsLength, mappedToLength, cdsSeq.getName()));
1001 * pre-fill the aligned cds sequence with gaps
1003 char[] alignedCds = new char[peptideLength * CODON_LENGTH
1004 + (addStopCodon ? CODON_LENGTH : 0)];
1005 Arrays.fill(alignedCds, gapChar);
1008 * walk over the aligned peptide sequence and insert mapped
1009 * codons for residues in the aligned cds sequence
1011 int copiedBases = 0;
1012 int cdsStart = cdsDss.getStart();
1013 int proteinPos = peptide.getStart() - 1;
1016 for (int col = 0; col < peptideLength; col++)
1018 char residue = peptide.getCharAt(col);
1020 if (Comparison.isGap(residue))
1022 cdsCol += CODON_LENGTH;
1027 int[] codon = mapList.locateInTo(proteinPos, proteinPos);
1030 // e.g. incomplete start codon, X in peptide
1031 cdsCol += CODON_LENGTH;
1035 for (int j = codon[0]; j <= codon[1]; j++)
1037 char mappedBase = cdsDss.getCharAt(j - cdsStart);
1038 alignedCds[cdsCol++] = mappedBase;
1046 * append stop codon if not mapped from protein,
1047 * closing it up to the end of the mapped sequence
1049 if (copiedBases == cdsLength - CODON_LENGTH)
1051 for (int i = alignedCds.length - 1; i >= 0; i--)
1053 if (!Comparison.isGap(alignedCds[i]))
1055 cdsCol = i + 1; // gap just after end of sequence
1059 for (int i = cdsLength - CODON_LENGTH; i < cdsLength; i++)
1061 alignedCds[cdsCol++] = cdsDss.getCharAt(i);
1064 cdsSeq.setSequence(new String(alignedCds));
1073 * Builds a map whose key is an aligned codon position (3 alignment column
1074 * numbers base 0), and whose value is a map from protein sequence to each
1075 * protein's peptide residue for that codon. The map generates an ordering of
1076 * the codons, and allows us to read off the peptides at each position in
1077 * order to assemble 'aligned' protein sequences.
1080 * the protein alignment
1082 * the coding dna alignment
1083 * @param unmappedProtein
1084 * any unmapped proteins are added to this list
1087 protected static Map<AlignedCodon, Map<SequenceI, AlignedCodon>> buildCodonColumnsMap(
1088 AlignmentI protein, AlignmentI dna,
1089 List<SequenceI> unmappedProtein)
1092 * maintain a list of any proteins with no mappings - these will be
1093 * rendered 'as is' in the protein alignment as we can't align them
1095 unmappedProtein.addAll(protein.getSequences());
1097 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
1100 * Map will hold, for each aligned codon position e.g. [3, 5, 6], a map of
1101 * {dnaSequence, {proteinSequence, codonProduct}} at that position. The
1102 * comparator keeps the codon positions ordered.
1104 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons = new TreeMap<>(
1105 new CodonComparator());
1107 for (SequenceI dnaSeq : dna.getSequences())
1109 for (AlignedCodonFrame mapping : mappings)
1111 SequenceI prot = mapping.findAlignedSequence(dnaSeq, protein);
1114 Mapping seqMap = mapping.getMappingForSequence(dnaSeq);
1115 addCodonPositions(dnaSeq, prot, protein.getGapCharacter(), seqMap,
1117 unmappedProtein.remove(prot);
1123 * Finally add any unmapped peptide start residues (e.g. for incomplete
1124 * codons) as if at the codon position before the second residue
1126 // TODO resolve JAL-2022 so this fudge can be removed
1127 int mappedSequenceCount = protein.getHeight() - unmappedProtein.size();
1128 addUnmappedPeptideStarts(alignedCodons, mappedSequenceCount);
1130 return alignedCodons;
1134 * Scans for any protein mapped from position 2 (meaning unmapped start
1135 * position e.g. an incomplete codon), and synthesizes a 'codon' for it at the
1136 * preceding position in the alignment
1138 * @param alignedCodons
1139 * the codon-to-peptide map
1140 * @param mappedSequenceCount
1141 * the number of distinct sequences in the map
1143 protected static void addUnmappedPeptideStarts(
1144 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1145 int mappedSequenceCount)
1147 // TODO delete this ugly hack once JAL-2022 is resolved
1148 // i.e. we can model startPhase > 0 (incomplete start codon)
1150 List<SequenceI> sequencesChecked = new ArrayList<>();
1151 AlignedCodon lastCodon = null;
1152 Map<SequenceI, AlignedCodon> toAdd = new HashMap<>();
1154 for (Entry<AlignedCodon, Map<SequenceI, AlignedCodon>> entry : alignedCodons
1157 for (Entry<SequenceI, AlignedCodon> sequenceCodon : entry.getValue()
1160 SequenceI seq = sequenceCodon.getKey();
1161 if (sequencesChecked.contains(seq))
1165 sequencesChecked.add(seq);
1166 AlignedCodon codon = sequenceCodon.getValue();
1167 if (codon.peptideCol > 1)
1169 jalview.bin.Console.errPrintln(
1170 "Problem mapping protein with >1 unmapped start positions: "
1173 else if (codon.peptideCol == 1)
1176 * first position (peptideCol == 0) was unmapped - add it
1178 if (lastCodon != null)
1180 AlignedCodon firstPeptide = new AlignedCodon(lastCodon.pos1,
1181 lastCodon.pos2, lastCodon.pos3,
1182 String.valueOf(seq.getCharAt(0)), 0);
1183 toAdd.put(seq, firstPeptide);
1188 * unmapped residue at start of alignment (no prior column) -
1189 * 'insert' at nominal codon [0, 0, 0]
1191 AlignedCodon firstPeptide = new AlignedCodon(0, 0, 0,
1192 String.valueOf(seq.getCharAt(0)), 0);
1193 toAdd.put(seq, firstPeptide);
1196 if (sequencesChecked.size() == mappedSequenceCount)
1198 // no need to check past first mapped position in all sequences
1202 lastCodon = entry.getKey();
1206 * add any new codons safely after iterating over the map
1208 for (Entry<SequenceI, AlignedCodon> startCodon : toAdd.entrySet())
1210 addCodonToMap(alignedCodons, startCodon.getValue(),
1211 startCodon.getKey());
1216 * Update the aligned protein sequences to match the codon alignments given in
1220 * @param alignedCodons
1221 * an ordered map of codon positions (columns), with sequence/peptide
1222 * values present in each column
1223 * @param unmappedProtein
1226 protected static int alignProteinAs(AlignmentI protein,
1227 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1228 List<SequenceI> unmappedProtein)
1231 * prefill peptide sequences with gaps
1233 int alignedWidth = alignedCodons.size();
1234 char[] gaps = new char[alignedWidth];
1235 Arrays.fill(gaps, protein.getGapCharacter());
1236 Map<SequenceI, char[]> peptides = new HashMap<>();
1237 for (SequenceI seq : protein.getSequences())
1239 if (!unmappedProtein.contains(seq))
1241 peptides.put(seq, Arrays.copyOf(gaps, gaps.length));
1246 * Traverse the codons left to right (as defined by CodonComparator)
1247 * and insert peptides in each column where the sequence is mapped.
1248 * This gives a peptide 'alignment' where residues are aligned if their
1249 * corresponding codons occupy the same columns in the cdna alignment.
1252 for (AlignedCodon codon : alignedCodons.keySet())
1254 final Map<SequenceI, AlignedCodon> columnResidues = alignedCodons
1256 for (Entry<SequenceI, AlignedCodon> entry : columnResidues.entrySet())
1258 char residue = entry.getValue().product.charAt(0);
1259 peptides.get(entry.getKey())[column] = residue;
1265 * and finally set the constructed sequences
1267 for (Entry<SequenceI, char[]> entry : peptides.entrySet())
1269 entry.getKey().setSequence(new String(entry.getValue()));
1276 * Populate the map of aligned codons by traversing the given sequence
1277 * mapping, locating the aligned positions of mapped codons, and adding those
1278 * positions and their translation products to the map.
1281 * the aligned sequence we are mapping from
1283 * the sequence to be aligned to the codons
1285 * the gap character in the dna sequence
1287 * a mapping to a sequence translation
1288 * @param alignedCodons
1289 * the map we are building up
1291 static void addCodonPositions(SequenceI dna, SequenceI protein,
1292 char gapChar, Mapping seqMap,
1293 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons)
1295 Iterator<AlignedCodon> codons = seqMap.getCodonIterator(dna, gapChar);
1298 * add codon positions, and their peptide translations, to the alignment
1299 * map, while remembering the first codon mapped
1301 while (codons.hasNext())
1305 AlignedCodon codon = codons.next();
1306 addCodonToMap(alignedCodons, codon, protein);
1307 } catch (IncompleteCodonException e)
1309 // possible incomplete trailing codon - ignore
1310 } catch (NoSuchElementException e)
1312 // possibly peptide lacking STOP
1318 * Helper method to add a codon-to-peptide entry to the aligned codons map
1320 * @param alignedCodons
1324 protected static void addCodonToMap(
1325 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1326 AlignedCodon codon, SequenceI protein)
1328 Map<SequenceI, AlignedCodon> seqProduct = alignedCodons.get(codon);
1329 if (seqProduct == null)
1331 seqProduct = new HashMap<>();
1332 alignedCodons.put(codon, seqProduct);
1334 seqProduct.put(protein, codon);
1338 * Returns true if a cDNA/Protein mapping either exists, or could be made,
1339 * between at least one pair of sequences in the two alignments. Currently,
1342 * <li>One alignment must be nucleotide, and the other protein</li>
1343 * <li>At least one pair of sequences must be already mapped, or mappable</li>
1344 * <li>Mappable means the nucleotide translation matches the protein
1346 * <li>The translation may ignore start and stop codons if present in the
1354 public static boolean isMappable(AlignmentI al1, AlignmentI al2)
1356 if (al1 == null || al2 == null)
1362 * Require one nucleotide and one protein
1364 if (al1.isNucleotide() == al2.isNucleotide())
1368 AlignmentI dna = al1.isNucleotide() ? al1 : al2;
1369 AlignmentI protein = dna == al1 ? al2 : al1;
1370 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
1371 for (SequenceI dnaSeq : dna.getSequences())
1373 for (SequenceI proteinSeq : protein.getSequences())
1375 if (isMappable(dnaSeq, proteinSeq, mappings))
1385 * Returns true if the dna sequence is mapped, or could be mapped, to the
1393 protected static boolean isMappable(SequenceI dnaSeq,
1394 SequenceI proteinSeq, List<AlignedCodonFrame> mappings)
1396 if (dnaSeq == null || proteinSeq == null)
1401 SequenceI dnaDs = dnaSeq.getDatasetSequence() == null ? dnaSeq
1402 : dnaSeq.getDatasetSequence();
1403 SequenceI proteinDs = proteinSeq.getDatasetSequence() == null
1405 : proteinSeq.getDatasetSequence();
1407 for (AlignedCodonFrame mapping : mappings)
1409 if (proteinDs == mapping.getAaForDnaSeq(dnaDs))
1419 * Just try to make a mapping (it is not yet stored), test whether
1422 return mapCdnaToProtein(proteinDs, dnaDs) != null;
1426 * Finds any reference annotations associated with the sequences in
1427 * sequenceScope, that are not already added to the alignment, and adds them
1428 * to the 'candidates' map. Also populates a lookup table of annotation
1429 * labels, keyed by calcId, for use in constructing tooltips or the like.
1431 * @param sequenceScope
1432 * the sequences to scan for reference annotations
1433 * @param labelForCalcId
1434 * (optional) map to populate with label for calcId
1436 * map to populate with annotations for sequence
1438 * the alignment to check for presence of annotations
1440 public static void findAddableReferenceAnnotations(
1441 List<SequenceI> sequenceScope, Map<String, String> labelForCalcId,
1442 final Map<SequenceI, List<AlignmentAnnotation>> candidates,
1445 if (sequenceScope == null)
1451 * For each sequence in scope, make a list of any annotations on the
1452 * underlying dataset sequence which are not already on the alignment.
1454 * Add to a map of { alignmentSequence, <List of annotations to add> }
1456 for (SequenceI seq : sequenceScope)
1458 SequenceI dataset = seq.getDatasetSequence();
1459 if (dataset == null)
1463 AlignmentAnnotation[] datasetAnnotations = dataset.getAnnotation();
1464 if (datasetAnnotations == null)
1468 final List<AlignmentAnnotation> result = new ArrayList<>();
1469 for (AlignmentAnnotation dsann : datasetAnnotations)
1472 * Find matching annotations on the alignment. If none is found, then
1473 * add this annotation to the list of 'addable' annotations for this
1476 final Iterable<AlignmentAnnotation> matchedAlignmentAnnotations = al
1477 .findAnnotations(seq, dsann.getCalcId(), dsann.label);
1478 boolean found = false;
1479 if (matchedAlignmentAnnotations != null)
1481 for (AlignmentAnnotation matched : matchedAlignmentAnnotations)
1483 if (dsann.description.equals(matched.description))
1493 if (labelForCalcId != null)
1495 labelForCalcId.put(dsann.getCalcId(), dsann.label);
1500 * Save any addable annotations for this sequence
1502 if (!result.isEmpty())
1504 candidates.put(seq, result);
1510 * Adds annotations to the top of the alignment annotations, in the same order
1511 * as their related sequences. If you already have an annotation and want to
1512 * add it to a sequence in an alignment use {@code addReferenceAnnotationTo}
1514 * @param annotations
1515 * the annotations to add
1517 * the alignment to add them to
1518 * @param selectionGroup
1519 * current selection group - may be null, if provided then any added
1520 * annotation will be trimmed to just those columns in the selection
1523 public static void addReferenceAnnotations(
1524 Map<SequenceI, List<AlignmentAnnotation>> annotations,
1525 final AlignmentI alignment, final SequenceGroup selectionGroup)
1527 for (SequenceI seq : annotations.keySet())
1529 for (AlignmentAnnotation ann : annotations.get(seq))
1531 addReferenceAnnotationTo(alignment, seq, ann, selectionGroup);
1537 * Make a copy of a reference annotation {@code ann} and add it to an
1538 * alignment sequence {@code seq} in {@code alignment}, optionally limited to
1539 * the extent of {@code selectionGroup}
1544 * @param selectionGroup
1545 * current selection group - may be null, if provided then any added
1546 * annotation will be trimmed to just those columns in the selection
1548 * @return annotation added to {@code seq and {@code alignment}
1550 public static AlignmentAnnotation addReferenceAnnotationTo(
1551 final AlignmentI alignment, final SequenceI seq,
1552 final AlignmentAnnotation ann, final SequenceGroup selectionGroup)
1554 AlignmentAnnotation copyAnn = new AlignmentAnnotation(ann);
1556 int endRes = ann.annotations.length;
1557 if (selectionGroup != null)
1559 startRes = -1 + Math.min(seq.getEnd(), Math.max(seq.getStart(),
1560 seq.findPosition(selectionGroup.getStartRes())));
1561 endRes = -1 + Math.min(seq.getEnd(),
1562 seq.findPosition(selectionGroup.getEndRes()));
1565 copyAnn.restrict(startRes, endRes + 0);
1568 * Add to the sequence (sets copyAnn.datasetSequence), unless the
1569 * original annotation is already on the sequence.
1571 if (!seq.hasAnnotation(ann))
1573 ContactMatrixI cm = seq.getDatasetSequence().getContactMatrixFor(ann);
1576 seq.addContactListFor(copyAnn, cm);
1578 seq.addAlignmentAnnotation(copyAnn);
1581 copyAnn.adjustForAlignment();
1582 // add to the alignment and set visible
1583 alignment.addAnnotation(copyAnn);
1584 copyAnn.visible = true;
1590 * Set visibility of alignment annotations of specified types (labels), for
1591 * specified sequences. This supports controls like "Show all secondary
1592 * structure", "Hide all Temp factor", etc.
1594 * @al the alignment to scan for annotations
1596 * the types (labels) of annotations to be updated
1597 * @param forSequences
1598 * if not null, only annotations linked to one of these sequences are
1599 * in scope for update; if null, acts on all sequence annotations
1601 * if this flag is true, 'types' is ignored (label not checked)
1603 * if true, set visibility on, else set off
1605 public static void showOrHideSequenceAnnotations(AlignmentI al,
1606 Collection<String> types, List<SequenceI> forSequences,
1607 boolean anyType, boolean doShow)
1609 AlignmentAnnotation[] anns = al.getAlignmentAnnotation();
1612 for (AlignmentAnnotation aa : anns)
1614 if (anyType || types.contains(aa.label))
1616 if ((aa.sequenceRef != null) && (forSequences == null
1617 || forSequences.contains(aa.sequenceRef)))
1619 aa.visible = doShow;
1626 public static AlignmentAnnotation getFirstSequenceAnnotationOfType(
1627 AlignmentI al, int graphType)
1629 AlignmentAnnotation[] anns = al.getAlignmentAnnotation();
1632 for (AlignmentAnnotation aa : anns)
1634 if (aa.sequenceRef != null && aa.graph == graphType)
1642 * Returns true if either sequence has a cross-reference to the other
1648 public static boolean haveCrossRef(SequenceI seq1, SequenceI seq2)
1650 // Note: moved here from class CrossRef as the latter class has dependencies
1651 // not availability to the applet's classpath
1652 return hasCrossRef(seq1, seq2) || hasCrossRef(seq2, seq1);
1656 * Returns true if seq1 has a cross-reference to seq2. Currently this assumes
1657 * that sequence name is structured as Source|AccessionId.
1663 public static boolean hasCrossRef(SequenceI seq1, SequenceI seq2)
1665 if (seq1 == null || seq2 == null)
1669 String name = seq2.getName();
1670 final List<DBRefEntry> xrefs = seq1.getDBRefs();
1673 for (int ix = 0, nx = xrefs.size(); ix < nx; ix++)
1675 DBRefEntry xref = xrefs.get(ix);
1676 String xrefName = xref.getSource() + "|" + xref.getAccessionId();
1677 // case-insensitive test, consistent with DBRefEntry.equalRef()
1678 if (xrefName.equalsIgnoreCase(name))
1688 * Constructs an alignment consisting of the mapped (CDS) regions in the given
1689 * nucleotide sequences, and updates mappings to match. The CDS sequences are
1690 * added to the original alignment's dataset, which is shared by the new
1691 * alignment. Mappings from nucleotide to CDS, and from CDS to protein, are
1692 * added to the alignment dataset.
1695 * aligned nucleotide (dna or cds) sequences
1697 * the alignment dataset the sequences belong to
1699 * (optional) to restrict results to CDS that map to specified
1701 * @return an alignment whose sequences are the cds-only parts of the dna
1702 * sequences (or null if no mappings are found)
1704 public static AlignmentI makeCdsAlignment(SequenceI[] dna,
1705 AlignmentI dataset, SequenceI[] products)
1707 if (dataset == null || dataset.getDataset() != null)
1709 throw new IllegalArgumentException(
1710 "IMPLEMENTATION ERROR: dataset.getDataset() must be null!");
1712 List<SequenceI> foundSeqs = new ArrayList<>();
1713 List<SequenceI> cdsSeqs = new ArrayList<>();
1714 List<AlignedCodonFrame> mappings = dataset.getCodonFrames();
1715 HashSet<SequenceI> productSeqs = null;
1716 if (products != null)
1718 productSeqs = new HashSet<>();
1719 for (SequenceI seq : products)
1721 productSeqs.add(seq.getDatasetSequence() == null ? seq
1722 : seq.getDatasetSequence());
1727 * Construct CDS sequences from mappings on the alignment dataset.
1729 * - find the protein product(s) mapped to from each dna sequence
1730 * - if the mapping covers the whole dna sequence (give or take start/stop
1731 * codon), take the dna as the CDS sequence
1732 * - else search dataset mappings for a suitable dna sequence, i.e. one
1733 * whose whole sequence is mapped to the protein
1734 * - if no sequence found, construct one from the dna sequence and mapping
1735 * (and add it to dataset so it is found if this is repeated)
1737 for (SequenceI dnaSeq : dna)
1739 SequenceI dnaDss = dnaSeq.getDatasetSequence() == null ? dnaSeq
1740 : dnaSeq.getDatasetSequence();
1742 List<AlignedCodonFrame> seqMappings = MappingUtils
1743 .findMappingsForSequence(dnaSeq, mappings);
1744 for (AlignedCodonFrame mapping : seqMappings)
1746 List<Mapping> mappingsFromSequence = mapping
1747 .getMappingsFromSequence(dnaSeq);
1749 for (Mapping aMapping : mappingsFromSequence)
1751 MapList mapList = aMapping.getMap();
1752 if (mapList.getFromRatio() == 1)
1755 * not a dna-to-protein mapping (likely dna-to-cds)
1761 * skip if mapping is not to one of the target set of proteins
1763 SequenceI proteinProduct = aMapping.getTo();
1764 if (productSeqs != null && !productSeqs.contains(proteinProduct))
1770 * try to locate the CDS from the dataset mappings;
1771 * guard against duplicate results (for the case that protein has
1772 * dbrefs to both dna and cds sequences)
1774 SequenceI cdsSeq = findCdsForProtein(mappings, dnaSeq,
1775 seqMappings, aMapping);
1778 if (!foundSeqs.contains(cdsSeq))
1780 foundSeqs.add(cdsSeq);
1781 SequenceI derivedSequence = cdsSeq.deriveSequence();
1782 cdsSeqs.add(derivedSequence);
1783 if (!dataset.getSequences().contains(cdsSeq))
1785 dataset.addSequence(cdsSeq);
1792 * didn't find mapped CDS sequence - construct it and add
1793 * its dataset sequence to the dataset
1795 cdsSeq = makeCdsSequence(dnaSeq.getDatasetSequence(), aMapping,
1796 dataset).deriveSequence();
1797 // cdsSeq has a name constructed as CDS|<dbref>
1798 // <dbref> will be either the accession for the coding sequence,
1799 // marked in the /via/ dbref to the protein product accession
1800 // or it will be the original nucleotide accession.
1801 SequenceI cdsSeqDss = cdsSeq.getDatasetSequence();
1803 cdsSeqs.add(cdsSeq);
1806 * build the mapping from CDS to protein
1808 List<int[]> cdsRange = Collections
1809 .singletonList(new int[]
1810 { cdsSeq.getStart(),
1811 cdsSeq.getLength() + cdsSeq.getStart() - 1 });
1812 MapList cdsToProteinMap = new MapList(cdsRange,
1813 mapList.getToRanges(), mapList.getFromRatio(),
1814 mapList.getToRatio());
1816 if (!dataset.getSequences().contains(cdsSeqDss))
1819 * if this sequence is a newly created one, add it to the dataset
1820 * and made a CDS to protein mapping (if sequence already exists,
1821 * CDS-to-protein mapping _is_ the transcript-to-protein mapping)
1823 dataset.addSequence(cdsSeqDss);
1824 AlignedCodonFrame cdsToProteinMapping = new AlignedCodonFrame();
1825 cdsToProteinMapping.addMap(cdsSeqDss, proteinProduct,
1829 * guard against duplicating the mapping if repeating this action
1831 if (!mappings.contains(cdsToProteinMapping))
1833 mappings.add(cdsToProteinMapping);
1837 propagateDBRefsToCDS(cdsSeqDss, dnaSeq.getDatasetSequence(),
1838 proteinProduct, aMapping);
1840 * add another mapping from original 'from' range to CDS
1842 AlignedCodonFrame dnaToCdsMapping = new AlignedCodonFrame();
1843 final MapList dnaToCdsMap = new MapList(mapList.getFromRanges(),
1845 dnaToCdsMapping.addMap(dnaSeq.getDatasetSequence(), cdsSeqDss,
1847 if (!mappings.contains(dnaToCdsMapping))
1849 mappings.add(dnaToCdsMapping);
1853 * transfer dna chromosomal loci (if known) to the CDS
1854 * sequence (via the mapping)
1856 final MapList cdsToDnaMap = dnaToCdsMap.getInverse();
1857 transferGeneLoci(dnaSeq, cdsToDnaMap, cdsSeq);
1860 * add DBRef with mapping from protein to CDS
1861 * (this enables Get Cross-References from protein alignment)
1862 * This is tricky because we can't have two DBRefs with the
1863 * same source and accession, so need a different accession for
1864 * the CDS from the dna sequence
1867 // specific use case:
1868 // Genomic contig ENSCHR:1, contains coding regions for ENSG01,
1869 // ENSG02, ENSG03, with transcripts and products similarly named.
1870 // cannot add distinct dbrefs mapping location on ENSCHR:1 to ENSG01
1872 // JBPNote: ?? can't actually create an example that demonstrates we
1874 // synthesize an xref.
1876 List<DBRefEntry> primrefs = dnaDss.getPrimaryDBRefs();
1877 for (int ip = 0, np = primrefs.size(); ip < np; ip++)
1879 DBRefEntry primRef = primrefs.get(ip);
1881 * create a cross-reference from CDS to the source sequence's
1882 * primary reference and vice versa
1884 String source = primRef.getSource();
1885 String version = primRef.getVersion();
1886 DBRefEntry cdsCrossRef = new DBRefEntry(source,
1887 source + ":" + version, primRef.getAccessionId());
1889 .setMap(new Mapping(dnaDss, new MapList(cdsToDnaMap)));
1890 cdsSeqDss.addDBRef(cdsCrossRef);
1892 dnaSeq.addDBRef(new DBRefEntry(source, version,
1893 cdsSeq.getName(), new Mapping(cdsSeqDss, dnaToCdsMap)));
1894 // problem here is that the cross-reference is synthesized -
1895 // cdsSeq.getName() may be like 'CDS|dnaaccession' or
1897 // assuming cds version same as dna ?!?
1899 DBRefEntry proteinToCdsRef = new DBRefEntry(source, version,
1902 proteinToCdsRef.setMap(
1903 new Mapping(cdsSeqDss, cdsToProteinMap.getInverse()));
1904 proteinProduct.addDBRef(proteinToCdsRef);
1907 * transfer any features on dna that overlap the CDS
1909 transferFeatures(dnaSeq, cdsSeq, dnaToCdsMap, null,
1910 SequenceOntologyI.CDS);
1915 AlignmentI cds = new Alignment(
1916 cdsSeqs.toArray(new SequenceI[cdsSeqs.size()]));
1917 cds.setDataset(dataset);
1923 * Tries to transfer gene loci (dbref to chromosome positions) from fromSeq to
1924 * toSeq, mediated by the given mapping between the sequences
1927 * @param targetToFrom
1931 protected static void transferGeneLoci(SequenceI fromSeq,
1932 MapList targetToFrom, SequenceI targetSeq)
1934 if (targetSeq.getGeneLoci() != null)
1936 // already have - don't override
1939 GeneLociI fromLoci = fromSeq.getGeneLoci();
1940 if (fromLoci == null)
1945 MapList newMap = targetToFrom.traverse(fromLoci.getMapping());
1949 targetSeq.setGeneLoci(fromLoci.getSpeciesId(),
1950 fromLoci.getAssemblyId(), fromLoci.getChromosomeId(), newMap);
1955 * A helper method that finds a CDS sequence in the alignment dataset that is
1956 * mapped to the given protein sequence, and either is, or has a mapping from,
1957 * the given dna sequence.
1960 * set of all mappings on the dataset
1962 * a dna (or cds) sequence we are searching from
1963 * @param seqMappings
1964 * the set of mappings involving dnaSeq
1966 * a transcript-to-peptide mapping
1969 static SequenceI findCdsForProtein(List<AlignedCodonFrame> mappings,
1970 SequenceI dnaSeq, List<AlignedCodonFrame> seqMappings,
1974 * TODO a better dna-cds-protein mapping data representation to allow easy
1975 * navigation; until then this clunky looping around lists of mappings
1977 SequenceI seqDss = dnaSeq.getDatasetSequence() == null ? dnaSeq
1978 : dnaSeq.getDatasetSequence();
1979 SequenceI proteinProduct = aMapping.getTo();
1982 * is this mapping from the whole dna sequence (i.e. CDS)?
1983 * allowing for possible stop codon on dna but not peptide
1985 int mappedFromLength = MappingUtils
1986 .getLength(aMapping.getMap().getFromRanges());
1987 int dnaLength = seqDss.getLength();
1988 if (mappedFromLength == dnaLength
1989 || mappedFromLength == dnaLength - CODON_LENGTH)
1992 * if sequence has CDS features, this is a transcript with no UTR
1993 * - do not take this as the CDS sequence! (JAL-2789)
1995 if (seqDss.getFeatures().getFeaturesByOntology(SequenceOntologyI.CDS)
2003 * looks like we found the dna-to-protein mapping; search for the
2004 * corresponding cds-to-protein mapping
2006 List<AlignedCodonFrame> mappingsToPeptide = MappingUtils
2007 .findMappingsForSequence(proteinProduct, mappings);
2008 for (AlignedCodonFrame acf : mappingsToPeptide)
2010 for (SequenceToSequenceMapping map : acf.getMappings())
2012 Mapping mapping = map.getMapping();
2013 if (mapping != aMapping
2014 && mapping.getMap().getFromRatio() == CODON_LENGTH
2015 && proteinProduct == mapping.getTo()
2016 && seqDss != map.getFromSeq())
2018 mappedFromLength = MappingUtils
2019 .getLength(mapping.getMap().getFromRanges());
2020 if (mappedFromLength == map.getFromSeq().getLength())
2023 * found a 3:1 mapping to the protein product which covers
2024 * the whole dna sequence i.e. is from CDS; finally check the CDS
2025 * is mapped from the given dna start sequence
2027 SequenceI cdsSeq = map.getFromSeq();
2028 // todo this test is weak if seqMappings contains multiple mappings;
2029 // we get away with it if transcript:cds relationship is 1:1
2030 List<AlignedCodonFrame> dnaToCdsMaps = MappingUtils
2031 .findMappingsForSequence(cdsSeq, seqMappings);
2032 if (!dnaToCdsMaps.isEmpty())
2044 * Helper method that makes a CDS sequence as defined by the mappings from the
2045 * given sequence i.e. extracts the 'mapped from' ranges (which may be on
2046 * forward or reverse strand).
2051 * - existing dataset. We check for sequences that look like the CDS
2052 * we are about to construct, if one exists already, then we will
2053 * just return that one.
2054 * @return CDS sequence (as a dataset sequence)
2056 static SequenceI makeCdsSequence(SequenceI seq, Mapping mapping,
2060 * construct CDS sequence name as "CDS|" with 'from id' held in the mapping
2061 * if set (e.g. EMBL protein_id), else sequence name appended
2063 String mapFromId = mapping.getMappedFromId();
2064 final String seqId = "CDS|"
2065 + (mapFromId != null ? mapFromId : seq.getName());
2067 SequenceI newSeq = null;
2070 * construct CDS sequence by splicing mapped from ranges
2072 char[] seqChars = seq.getSequence();
2073 List<int[]> fromRanges = mapping.getMap().getFromRanges();
2074 int cdsWidth = MappingUtils.getLength(fromRanges);
2075 char[] newSeqChars = new char[cdsWidth];
2078 for (int[] range : fromRanges)
2080 if (range[0] <= range[1])
2082 // forward strand mapping - just copy the range
2083 int length = range[1] - range[0] + 1;
2084 System.arraycopy(seqChars, range[0] - 1, newSeqChars, newPos,
2090 // reverse strand mapping - copy and complement one by one
2091 for (int i = range[0]; i >= range[1]; i--)
2093 newSeqChars[newPos++] = Dna.getComplement(seqChars[i - 1]);
2097 newSeq = new Sequence(seqId, newSeqChars, 1, newPos);
2100 if (dataset != null)
2102 SequenceI[] matches = dataset.findSequenceMatch(newSeq.getName());
2103 if (matches != null)
2105 boolean matched = false;
2106 for (SequenceI mtch : matches)
2108 if (mtch.getStart() != newSeq.getStart())
2112 if (mtch.getEnd() != newSeq.getEnd())
2116 if (!Arrays.equals(mtch.getSequence(), newSeq.getSequence()))
2128 "JAL-2154 regression: warning - found (and ignored) a duplicate CDS sequence:"
2134 // newSeq.setDescription(mapFromId);
2140 * Adds any DBRefEntrys to cdsSeq from contig that have a Mapping congruent to
2141 * the given mapping.
2145 * @param proteinProduct
2147 * @return list of DBRefEntrys added
2149 protected static List<DBRefEntry> propagateDBRefsToCDS(SequenceI cdsSeq,
2150 SequenceI contig, SequenceI proteinProduct, Mapping mapping)
2153 // gather direct refs from contig congruent with mapping
2154 List<DBRefEntry> direct = new ArrayList<>();
2155 HashSet<String> directSources = new HashSet<>();
2157 List<DBRefEntry> refs = contig.getDBRefs();
2160 for (int ib = 0, nb = refs.size(); ib < nb; ib++)
2162 DBRefEntry dbr = refs.get(ib);
2164 if (dbr.hasMap() && (map = dbr.getMap().getMap()).isTripletMap())
2166 // check if map is the CDS mapping
2167 if (mapping.getMap().equals(map))
2170 directSources.add(dbr.getSource());
2175 List<DBRefEntry> onSource = DBRefUtils.selectRefs(
2176 proteinProduct.getDBRefs(),
2177 directSources.toArray(new String[0]));
2178 List<DBRefEntry> propagated = new ArrayList<>();
2180 // and generate appropriate mappings
2181 for (int ic = 0, nc = direct.size(); ic < nc; ic++)
2183 DBRefEntry cdsref = direct.get(ic);
2184 Mapping m = cdsref.getMap();
2185 // clone maplist and mapping
2186 MapList cdsposmap = new MapList(
2187 Arrays.asList(new int[][]
2188 { new int[] { cdsSeq.getStart(), cdsSeq.getEnd() } }),
2189 m.getMap().getToRanges(), 3, 1);
2190 Mapping cdsmap = new Mapping(m.getTo(), m.getMap());
2193 DBRefEntry newref = new DBRefEntry(cdsref.getSource(),
2194 cdsref.getVersion(), cdsref.getAccessionId(),
2195 new Mapping(cdsmap.getTo(), cdsposmap));
2197 // and see if we can map to the protein product for this mapping.
2198 // onSource is the filtered set of accessions on protein that we are
2199 // tranferring, so we assume accession is the same.
2200 if (cdsmap.getTo() == null && onSource != null)
2202 List<DBRefEntry> sourceRefs = DBRefUtils.searchRefs(onSource,
2203 cdsref.getAccessionId());
2204 if (sourceRefs != null)
2206 for (DBRefEntry srcref : sourceRefs)
2208 if (srcref.getSource().equalsIgnoreCase(cdsref.getSource()))
2210 // we have found a complementary dbref on the protein product, so
2211 // update mapping's getTo
2212 newref.getMap().setTo(proteinProduct);
2217 cdsSeq.addDBRef(newref);
2218 propagated.add(newref);
2224 * Transfers co-located features on 'fromSeq' to 'toSeq', adjusting the
2225 * feature start/end ranges, optionally omitting specified feature types.
2226 * Returns the number of features copied.
2231 * the mapping from 'fromSeq' to 'toSeq'
2233 * if not null, only features of this type are copied (including
2234 * subtypes in the Sequence Ontology)
2237 protected static int transferFeatures(SequenceI fromSeq, SequenceI toSeq,
2238 MapList mapping, String select, String... omitting)
2240 SequenceI copyTo = toSeq;
2241 while (copyTo.getDatasetSequence() != null)
2243 copyTo = copyTo.getDatasetSequence();
2245 if (fromSeq == copyTo || fromSeq.getDatasetSequence() == copyTo)
2247 return 0; // shared dataset sequence
2251 * get features, optionally restricted by an ontology term
2253 List<SequenceFeature> sfs = select == null
2254 ? fromSeq.getFeatures().getPositionalFeatures()
2255 : fromSeq.getFeatures().getFeaturesByOntology(select);
2258 for (SequenceFeature sf : sfs)
2260 String type = sf.getType();
2261 boolean omit = false;
2262 for (String toOmit : omitting)
2264 if (type.equals(toOmit))
2275 * locate the mapped range - null if either start or end is
2276 * not mapped (no partial overlaps are calculated)
2278 int start = sf.getBegin();
2279 int end = sf.getEnd();
2280 int[] mappedTo = mapping.locateInTo(start, end);
2282 * if whole exon range doesn't map, try interpreting it
2283 * as 5' or 3' exon overlapping the CDS range
2285 if (mappedTo == null)
2287 mappedTo = mapping.locateInTo(end, end);
2288 if (mappedTo != null)
2291 * end of exon is in CDS range - 5' overlap
2292 * to a range from the start of the peptide
2297 if (mappedTo == null)
2299 mappedTo = mapping.locateInTo(start, start);
2300 if (mappedTo != null)
2303 * start of exon is in CDS range - 3' overlap
2304 * to a range up to the end of the peptide
2306 mappedTo[1] = toSeq.getLength();
2309 if (mappedTo != null)
2311 int newBegin = Math.min(mappedTo[0], mappedTo[1]);
2312 int newEnd = Math.max(mappedTo[0], mappedTo[1]);
2313 SequenceFeature copy = new SequenceFeature(sf, newBegin, newEnd,
2314 sf.getFeatureGroup(), sf.getScore());
2315 copyTo.addSequenceFeature(copy);
2323 * Returns a mapping from dna to protein by inspecting sequence features of
2324 * type "CDS" on the dna. A mapping is constructed if the total CDS feature
2325 * length is 3 times the peptide length (optionally after dropping a trailing
2326 * stop codon). This method does not check whether the CDS nucleotide sequence
2327 * translates to the peptide sequence.
2333 public static MapList mapCdsToProtein(SequenceI dnaSeq,
2334 SequenceI proteinSeq)
2336 List<int[]> ranges = findCdsPositions(dnaSeq);
2337 int mappedDnaLength = MappingUtils.getLength(ranges);
2340 * if not a whole number of codons, truncate mapping
2342 int codonRemainder = mappedDnaLength % CODON_LENGTH;
2343 if (codonRemainder > 0)
2345 mappedDnaLength -= codonRemainder;
2346 MappingUtils.removeEndPositions(codonRemainder, ranges);
2349 int proteinLength = proteinSeq.getLength();
2350 int proteinStart = proteinSeq.getStart();
2351 int proteinEnd = proteinSeq.getEnd();
2354 * incomplete start codon may mean X at start of peptide
2355 * we ignore both for mapping purposes
2357 if (proteinSeq.getCharAt(0) == 'X')
2359 // todo JAL-2022 support startPhase > 0
2363 List<int[]> proteinRange = new ArrayList<>();
2366 * dna length should map to protein (or protein plus stop codon)
2368 int codesForResidues = mappedDnaLength / CODON_LENGTH;
2369 if (codesForResidues == (proteinLength + 1))
2371 // assuming extra codon is for STOP and not in peptide
2372 // todo: check trailing codon is indeed a STOP codon
2374 mappedDnaLength -= CODON_LENGTH;
2375 MappingUtils.removeEndPositions(CODON_LENGTH, ranges);
2378 if (codesForResidues == proteinLength)
2380 proteinRange.add(new int[] { proteinStart, proteinEnd });
2381 return new MapList(ranges, proteinRange, CODON_LENGTH, 1);
2387 * Returns a list of CDS ranges found (as sequence positions base 1), i.e. of
2388 * [start, end] positions of sequence features of type "CDS" (or a sub-type of
2389 * CDS in the Sequence Ontology). The ranges are sorted into ascending start
2390 * position order, so this method is only valid for linear CDS in the same
2391 * sense as the protein product.
2396 protected static List<int[]> findCdsPositions(SequenceI dnaSeq)
2398 List<int[]> result = new ArrayList<>();
2400 List<SequenceFeature> sfs = dnaSeq.getFeatures()
2401 .getFeaturesByOntology(SequenceOntologyI.CDS);
2406 SequenceFeatures.sortFeatures(sfs, true);
2408 for (SequenceFeature sf : sfs)
2413 String s = sf.getPhase();
2416 phase = Integer.parseInt(s);
2418 } catch (NumberFormatException e)
2423 * phase > 0 on first codon means 5' incomplete - skip to the start
2424 * of the next codon; example ENST00000496384
2426 int begin = sf.getBegin();
2427 int end = sf.getEnd();
2428 if (result.isEmpty() && phase > 0)
2433 // shouldn't happen!
2435 .println("Error: start phase extends beyond start CDS in "
2436 + dnaSeq.getName());
2439 result.add(new int[] { begin, end });
2443 * Finally sort ranges by start position. This avoids a dependency on
2444 * keeping features in order on the sequence (if they are in order anyway,
2445 * the sort will have almost no work to do). The implicit assumption is CDS
2446 * ranges are assembled in order. Other cases should not use this method,
2447 * but instead construct an explicit mapping for CDS (e.g. EMBL parsing).
2449 Collections.sort(result, IntRangeComparator.ASCENDING);
2454 * Makes an alignment with a copy of the given sequences, adding in any
2455 * non-redundant sequences which are mapped to by the cross-referenced
2461 * the alignment dataset shared by the new copy
2464 public static AlignmentI makeCopyAlignment(SequenceI[] seqs,
2465 SequenceI[] xrefs, AlignmentI dataset)
2467 AlignmentI copy = new Alignment(new Alignment(seqs));
2468 copy.setDataset(dataset);
2469 boolean isProtein = !copy.isNucleotide();
2470 SequenceIdMatcher matcher = new SequenceIdMatcher(seqs);
2473 // BH 2019.01.25 recoded to remove iterators
2475 for (int ix = 0, nx = xrefs.length; ix < nx; ix++)
2477 SequenceI xref = xrefs[ix];
2478 List<DBRefEntry> dbrefs = xref.getDBRefs();
2481 for (int ir = 0, nir = dbrefs.size(); ir < nir; ir++)
2483 DBRefEntry dbref = dbrefs.get(ir);
2484 Mapping map = dbref.getMap();
2486 if (map == null || (mto = map.getTo()) == null
2487 || mto.isProtein() != isProtein)
2491 SequenceI mappedTo = mto;
2492 SequenceI match = matcher.findIdMatch(mappedTo);
2495 matcher.add(mappedTo);
2496 copy.addSequence(mappedTo);
2506 * Try to align sequences in 'unaligned' to match the alignment of their
2507 * mapped regions in 'aligned'. For example, could use this to align CDS
2508 * sequences which are mapped to their parent cDNA sequences.
2510 * This method handles 1:1 mappings (dna-to-dna or protein-to-protein). For
2511 * dna-to-protein or protein-to-dna use alternative methods.
2514 * sequences to be aligned
2516 * holds aligned sequences and their mappings
2519 public static int alignAs(AlignmentI unaligned, AlignmentI aligned)
2522 * easy case - aligning a copy of aligned sequences
2524 if (alignAsSameSequences(unaligned, aligned))
2526 return unaligned.getHeight();
2530 * fancy case - aligning via mappings between sequences
2532 List<SequenceI> unmapped = new ArrayList<>();
2533 Map<Integer, Map<SequenceI, Character>> columnMap = buildMappedColumnsMap(
2534 unaligned, aligned, unmapped);
2535 int width = columnMap.size();
2536 char gap = unaligned.getGapCharacter();
2537 int realignedCount = 0;
2538 // TODO: verify this loop scales sensibly for very wide/high alignments
2540 for (SequenceI seq : unaligned.getSequences())
2542 if (!unmapped.contains(seq))
2544 char[] newSeq = new char[width];
2545 Arrays.fill(newSeq, gap); // JBPComment - doubt this is faster than the
2546 // Integer iteration below
2551 * traverse the map to find columns populated
2554 for (Integer column : columnMap.keySet())
2556 Character c = columnMap.get(column).get(seq);
2560 * sequence has a character at this position
2570 * trim trailing gaps
2572 if (lastCol < width)
2574 char[] tmp = new char[lastCol + 1];
2575 System.arraycopy(newSeq, 0, tmp, 0, lastCol + 1);
2578 // TODO: optimise SequenceI to avoid char[]->String->char[]
2579 seq.setSequence(String.valueOf(newSeq));
2583 return realignedCount;
2587 * If unaligned and aligned sequences share the same dataset sequences, then
2588 * simply copies the aligned sequences to the unaligned sequences and returns
2589 * true; else returns false
2592 * - sequences to be aligned based on aligned
2594 * - 'guide' alignment containing sequences derived from same dataset
2598 static boolean alignAsSameSequences(AlignmentI unaligned,
2601 if (aligned.getDataset() == null || unaligned.getDataset() == null)
2603 return false; // should only pass alignments with datasets here
2606 // map from dataset sequence to alignment sequence(s)
2607 Map<SequenceI, List<SequenceI>> alignedDatasets = new HashMap<>();
2608 for (SequenceI seq : aligned.getSequences())
2610 SequenceI ds = seq.getDatasetSequence();
2611 if (alignedDatasets.get(ds) == null)
2613 alignedDatasets.put(ds, new ArrayList<SequenceI>());
2615 alignedDatasets.get(ds).add(seq);
2619 * first pass - check whether all sequences to be aligned share a
2620 * dataset sequence with an aligned sequence; also note the leftmost
2621 * ungapped column from which to copy
2623 int leftmost = Integer.MAX_VALUE;
2624 for (SequenceI seq : unaligned.getSequences())
2626 final SequenceI ds = seq.getDatasetSequence();
2627 if (!alignedDatasets.containsKey(ds))
2631 SequenceI alignedSeq = alignedDatasets.get(ds).get(0);
2632 int startCol = alignedSeq.findIndex(seq.getStart()); // 1..
2633 leftmost = Math.min(leftmost, startCol);
2637 * second pass - copy aligned sequences;
2638 * heuristic rule: pair off sequences in order for the case where
2639 * more than one shares the same dataset sequence
2641 final char gapCharacter = aligned.getGapCharacter();
2642 for (SequenceI seq : unaligned.getSequences())
2644 List<SequenceI> alignedSequences = alignedDatasets
2645 .get(seq.getDatasetSequence());
2646 if (alignedSequences.isEmpty())
2649 * defensive check - shouldn't happen! (JAL-3536)
2653 SequenceI alignedSeq = alignedSequences.get(0);
2656 * gap fill for leading (5') UTR if any
2658 // TODO this copies intron columns - wrong!
2659 int startCol = alignedSeq.findIndex(seq.getStart()); // 1..
2660 int endCol = alignedSeq.findIndex(seq.getEnd());
2661 char[] seqchars = new char[endCol - leftmost + 1];
2662 Arrays.fill(seqchars, gapCharacter);
2663 char[] toCopy = alignedSeq.getSequence(startCol - 1, endCol);
2664 System.arraycopy(toCopy, 0, seqchars, startCol - leftmost,
2666 seq.setSequence(String.valueOf(seqchars));
2667 if (alignedSequences.size() > 0)
2669 // pop off aligned sequences (except the last one)
2670 alignedSequences.remove(0);
2675 * finally remove gapped columns (e.g. introns)
2677 new RemoveGapColCommand("", unaligned.getSequencesArray(), 0,
2678 unaligned.getWidth() - 1, unaligned);
2684 * Returns a map whose key is alignment column number (base 1), and whose
2685 * values are a map of sequence characters in that column.
2692 static SortedMap<Integer, Map<SequenceI, Character>> buildMappedColumnsMap(
2693 AlignmentI unaligned, AlignmentI aligned,
2694 List<SequenceI> unmapped)
2697 * Map will hold, for each aligned column position, a map of
2698 * {unalignedSequence, characterPerSequence} at that position.
2699 * TreeMap keeps the entries in ascending column order.
2701 SortedMap<Integer, Map<SequenceI, Character>> map = new TreeMap<>();
2704 * record any sequences that have no mapping so can't be realigned
2706 unmapped.addAll(unaligned.getSequences());
2708 List<AlignedCodonFrame> mappings = aligned.getCodonFrames();
2710 for (SequenceI seq : unaligned.getSequences())
2712 for (AlignedCodonFrame mapping : mappings)
2714 SequenceI fromSeq = mapping.findAlignedSequence(seq, aligned);
2715 if (fromSeq != null)
2717 Mapping seqMap = mapping.getMappingBetween(fromSeq, seq);
2718 if (addMappedPositions(seq, fromSeq, seqMap, map))
2720 unmapped.remove(seq);
2729 * Helper method that adds to a map the mapped column positions of a sequence.
2731 * For example if aaTT-Tg-gAAA is mapped to TTTAAA then the map should record
2732 * that columns 3,4,6,10,11,12 map to characters T,T,T,A,A,A of the mapped to
2736 * the sequence whose column positions we are recording
2738 * a sequence that is mapped to the first sequence
2740 * the mapping from 'fromSeq' to 'seq'
2742 * a map to add the column positions (in fromSeq) of the mapped
2746 static boolean addMappedPositions(SequenceI seq, SequenceI fromSeq,
2747 Mapping seqMap, Map<Integer, Map<SequenceI, Character>> map)
2755 * invert mapping if it is from unaligned to aligned sequence
2757 if (seqMap.getTo() == fromSeq.getDatasetSequence())
2759 seqMap = new Mapping(seq.getDatasetSequence(),
2760 seqMap.getMap().getInverse());
2763 int toStart = seq.getStart();
2766 * traverse [start, end, start, end...] ranges in fromSeq
2768 for (int[] fromRange : seqMap.getMap().getFromRanges())
2770 for (int i = 0; i < fromRange.length - 1; i += 2)
2772 boolean forward = fromRange[i + 1] >= fromRange[i];
2775 * find the range mapped to (sequence positions base 1)
2777 int[] range = seqMap.locateMappedRange(fromRange[i],
2781 jalview.bin.Console.errPrintln("Error in mapping " + seqMap
2782 + " from " + fromSeq.getName());
2785 int fromCol = fromSeq.findIndex(fromRange[i]);
2786 int mappedCharPos = range[0];
2789 * walk over the 'from' aligned sequence in forward or reverse
2790 * direction; when a non-gap is found, record the column position
2791 * of the next character of the mapped-to sequence; stop when all
2792 * the characters of the range have been counted
2794 while (mappedCharPos <= range[1] && fromCol <= fromSeq.getLength()
2797 if (!Comparison.isGap(fromSeq.getCharAt(fromCol - 1)))
2800 * mapped from sequence has a character in this column
2801 * record the column position for the mapped to character
2803 Map<SequenceI, Character> seqsMap = map.get(fromCol);
2804 if (seqsMap == null)
2806 seqsMap = new HashMap<>();
2807 map.put(fromCol, seqsMap);
2809 seqsMap.put(seq, seq.getCharAt(mappedCharPos - toStart));
2812 fromCol += (forward ? 1 : -1);
2819 // strictly temporary hack until proper criteria for aligning protein to cds
2820 // are in place; this is so Ensembl -> fetch xrefs Uniprot aligns the Uniprot
2821 public static boolean looksLikeEnsembl(AlignmentI alignment)
2823 for (SequenceI seq : alignment.getSequences())
2825 String name = seq.getName();
2826 if (!name.startsWith("ENSG") && !name.startsWith("ENST"))