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 // System.out.println(("Mismatch at " + i + "/" + aaResidue + ": "
551 // + codon + "(" + translated + ") != " + aaRes));
557 * check we matched all of the protein sequence
559 if (aaPos != aaSeqChars.length)
565 * check we matched all of the dna except
566 * for optional trailing STOP codon
568 if (dnaPos == cdnaSeqChars.length)
572 if (dnaPos == cdnaSeqChars.length - CODON_LENGTH)
574 String codon = String.valueOf(cdnaSeqChars, dnaPos, CODON_LENGTH);
575 if (ResidueProperties.STOP
576 .equals(ResidueProperties.codonTranslate(codon)))
585 * Align sequence 'seq' to match the alignment of a mapped sequence. Note this
586 * currently assumes that we are aligning cDNA to match protein.
589 * the sequence to be realigned
591 * the alignment whose sequence alignment is to be 'copied'
593 * character string represent a gap in the realigned sequence
594 * @param preserveUnmappedGaps
595 * @param preserveMappedGaps
596 * @return true if the sequence was realigned, false if it could not be
598 public static boolean alignSequenceAs(SequenceI seq, AlignmentI al,
599 String gap, boolean preserveMappedGaps,
600 boolean preserveUnmappedGaps)
603 * Get any mappings from the source alignment to the target (dataset)
606 // TODO there may be one AlignedCodonFrame per dataset sequence, or one with
607 // all mappings. Would it help to constrain this?
608 List<AlignedCodonFrame> mappings = al.getCodonFrame(seq);
609 if (mappings == null || mappings.isEmpty())
615 * Locate the aligned source sequence whose dataset sequence is mapped. We
616 * just take the first match here (as we can't align like more than one
619 SequenceI alignFrom = null;
620 AlignedCodonFrame mapping = null;
621 for (AlignedCodonFrame mp : mappings)
623 alignFrom = mp.findAlignedSequence(seq, al);
624 if (alignFrom != null)
631 if (alignFrom == null)
635 alignSequenceAs(seq, alignFrom, mapping, gap, al.getGapCharacter(),
636 preserveMappedGaps, preserveUnmappedGaps);
641 * Align sequence 'alignTo' the same way as 'alignFrom', using the mapping to
642 * match residues and codons. Flags control whether existing gaps in unmapped
643 * (intron) and mapped (exon) regions are preserved or not. Gaps between
644 * intron and exon are only retained if both flags are set.
651 * @param preserveUnmappedGaps
652 * @param preserveMappedGaps
654 public static void alignSequenceAs(SequenceI alignTo, SequenceI alignFrom,
655 AlignedCodonFrame mapping, String myGap, char sourceGap,
656 boolean preserveMappedGaps, boolean preserveUnmappedGaps)
658 // TODO generalise to work for Protein-Protein, dna-dna, dna-protein
660 // aligned and dataset sequence positions, all base zero
664 int basesWritten = 0;
665 char myGapChar = myGap.charAt(0);
666 int ratio = myGap.length();
668 int fromOffset = alignFrom.getStart() - 1;
669 int toOffset = alignTo.getStart() - 1;
670 int sourceGapMappedLength = 0;
671 boolean inExon = false;
672 final int toLength = alignTo.getLength();
673 final int fromLength = alignFrom.getLength();
674 StringBuilder thisAligned = new StringBuilder(2 * toLength);
677 * Traverse the 'model' aligned sequence
679 for (int i = 0; i < fromLength; i++)
681 char sourceChar = alignFrom.getCharAt(i);
682 if (sourceChar == sourceGap)
684 sourceGapMappedLength += ratio;
689 * Found a non-gap character. Locate its mapped region if any.
692 // Note mapping positions are base 1, our sequence positions base 0
693 int[] mappedPos = mapping.getMappedRegion(alignTo, alignFrom,
694 sourceDsPos + fromOffset);
695 if (mappedPos == null)
698 * unmapped position; treat like a gap
700 sourceGapMappedLength += ratio;
701 // System.err.println("Can't align: no codon mapping to residue "
702 // + sourceDsPos + "(" + sourceChar + ")");
707 int mappedCodonStart = mappedPos[0]; // position (1...) of codon start
708 int mappedCodonEnd = mappedPos[mappedPos.length - 1]; // codon end pos
709 StringBuilder trailingCopiedGap = new StringBuilder();
712 * Copy dna sequence up to and including this codon. Optionally, include
713 * gaps before the codon starts (in introns) and/or after the codon starts
716 * Note this only works for 'linear' splicing, not reverse or interleaved.
717 * But then 'align dna as protein' doesn't make much sense otherwise.
719 int intronLength = 0;
720 while (basesWritten + toOffset < mappedCodonEnd
721 && thisSeqPos < toLength)
723 final char c = alignTo.getCharAt(thisSeqPos++);
727 int sourcePosition = basesWritten + toOffset;
728 if (sourcePosition < mappedCodonStart)
731 * Found an unmapped (intron) base. First add in any preceding gaps
734 if (preserveUnmappedGaps && trailingCopiedGap.length() > 0)
736 thisAligned.append(trailingCopiedGap.toString());
737 intronLength += trailingCopiedGap.length();
738 trailingCopiedGap = new StringBuilder();
745 final boolean startOfCodon = sourcePosition == mappedCodonStart;
746 int gapsToAdd = calculateGapsToInsert(preserveMappedGaps,
747 preserveUnmappedGaps, sourceGapMappedLength, inExon,
748 trailingCopiedGap.length(), intronLength, startOfCodon);
749 for (int k = 0; k < gapsToAdd; k++)
751 thisAligned.append(myGapChar);
753 sourceGapMappedLength = 0;
756 thisAligned.append(c);
757 trailingCopiedGap = new StringBuilder();
761 if (inExon && preserveMappedGaps)
763 trailingCopiedGap.append(myGapChar);
765 else if (!inExon && preserveUnmappedGaps)
767 trailingCopiedGap.append(myGapChar);
774 * At end of model aligned sequence. Copy any remaining target sequence, optionally
775 * including (intron) gaps.
777 while (thisSeqPos < toLength)
779 final char c = alignTo.getCharAt(thisSeqPos++);
780 if (c != myGapChar || preserveUnmappedGaps)
782 thisAligned.append(c);
784 sourceGapMappedLength--;
788 * finally add gaps to pad for any trailing source gaps or
789 * unmapped characters
791 if (preserveUnmappedGaps)
793 while (sourceGapMappedLength > 0)
795 thisAligned.append(myGapChar);
796 sourceGapMappedLength--;
801 * All done aligning, set the aligned sequence.
803 alignTo.setSequence(new String(thisAligned));
807 * Helper method to work out how many gaps to insert when realigning.
809 * @param preserveMappedGaps
810 * @param preserveUnmappedGaps
811 * @param sourceGapMappedLength
813 * @param trailingCopiedGap
814 * @param intronLength
815 * @param startOfCodon
818 protected static int calculateGapsToInsert(boolean preserveMappedGaps,
819 boolean preserveUnmappedGaps, int sourceGapMappedLength,
820 boolean inExon, int trailingGapLength, int intronLength,
821 final boolean startOfCodon)
827 * Reached start of codon. Ignore trailing gaps in intron unless we are
828 * preserving gaps in both exon and intron. Ignore them anyway if the
829 * protein alignment introduces a gap at least as large as the intronic
832 if (inExon && !preserveMappedGaps)
834 trailingGapLength = 0;
836 if (!inExon && !(preserveMappedGaps && preserveUnmappedGaps))
838 trailingGapLength = 0;
842 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
846 if (intronLength + trailingGapLength <= sourceGapMappedLength)
848 gapsToAdd = sourceGapMappedLength - intronLength;
852 gapsToAdd = Math.min(
853 intronLength + trailingGapLength - sourceGapMappedLength,
861 * second or third base of codon; check for any gaps in dna
863 if (!preserveMappedGaps)
865 trailingGapLength = 0;
867 gapsToAdd = Math.max(sourceGapMappedLength, trailingGapLength);
873 * Realigns the given protein to match the alignment of the dna, using codon
874 * mappings to translate aligned codon positions to protein residues.
877 * the alignment whose sequences are realigned by this method
879 * the dna alignment whose alignment we are 'copying'
880 * @return the number of sequences that were realigned
882 public static int alignProteinAsDna(AlignmentI protein, AlignmentI dna)
884 if (protein.isNucleotide() || !dna.isNucleotide())
886 System.err.println("Wrong alignment type in alignProteinAsDna");
889 List<SequenceI> unmappedProtein = new ArrayList<>();
890 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons = buildCodonColumnsMap(
891 protein, dna, unmappedProtein);
892 return alignProteinAs(protein, alignedCodons, unmappedProtein);
896 * Realigns the given dna to match the alignment of the protein, using codon
897 * mappings to translate aligned peptide positions to codons.
899 * Always produces a padded CDS alignment.
902 * the alignment whose sequences are realigned by this method
904 * the protein alignment whose alignment we are 'copying'
905 * @return the number of sequences that were realigned
907 public static int alignCdsAsProtein(AlignmentI dna, AlignmentI protein)
909 if (protein.isNucleotide() || !dna.isNucleotide())
911 System.err.println("Wrong alignment type in alignProteinAsDna");
914 // todo: implement this
915 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
916 int alignedCount = 0;
917 int width = 0; // alignment width for padding CDS
918 for (SequenceI dnaSeq : dna.getSequences())
920 if (alignCdsSequenceAsProtein(dnaSeq, protein, mappings,
921 dna.getGapCharacter()))
925 width = Math.max(dnaSeq.getLength(), width);
929 for (SequenceI dnaSeq : dna.getSequences())
931 oldwidth = dnaSeq.getLength();
932 diff = width - oldwidth;
935 dnaSeq.insertCharAt(oldwidth, diff, dna.getGapCharacter());
942 * Helper method to align (if possible) the dna sequence to match the
943 * alignment of a mapped protein sequence. This is currently limited to
944 * handling coding sequence only.
952 static boolean alignCdsSequenceAsProtein(SequenceI cdsSeq,
953 AlignmentI protein, List<AlignedCodonFrame> mappings,
956 SequenceI cdsDss = cdsSeq.getDatasetSequence();
960 .println("alignCdsSequenceAsProtein needs aligned sequence!");
964 List<AlignedCodonFrame> dnaMappings = MappingUtils
965 .findMappingsForSequence(cdsSeq, mappings);
966 for (AlignedCodonFrame mapping : dnaMappings)
968 SequenceI peptide = mapping.findAlignedSequence(cdsSeq, protein);
971 final int peptideLength = peptide.getLength();
972 Mapping map = mapping.getMappingBetween(cdsSeq, peptide);
975 MapList mapList = map.getMap();
976 if (map.getTo() == peptide.getDatasetSequence())
978 mapList = mapList.getInverse();
980 final int cdsLength = cdsDss.getLength();
981 int mappedFromLength = MappingUtils
982 .getLength(mapList.getFromRanges());
983 int mappedToLength = MappingUtils
984 .getLength(mapList.getToRanges());
985 boolean addStopCodon = (cdsLength == mappedFromLength
986 * CODON_LENGTH + CODON_LENGTH)
987 || (peptide.getDatasetSequence()
988 .getLength() == mappedFromLength - 1);
989 if (cdsLength != mappedToLength && !addStopCodon)
991 System.err.println(String.format(
992 "Can't align cds as protein (length mismatch %d/%d): %s",
993 cdsLength, mappedToLength, cdsSeq.getName()));
997 * pre-fill the aligned cds sequence with gaps
999 char[] alignedCds = new char[peptideLength * CODON_LENGTH
1000 + (addStopCodon ? CODON_LENGTH : 0)];
1001 Arrays.fill(alignedCds, gapChar);
1004 * walk over the aligned peptide sequence and insert mapped
1005 * codons for residues in the aligned cds sequence
1007 int copiedBases = 0;
1008 int cdsStart = cdsDss.getStart();
1009 int proteinPos = peptide.getStart() - 1;
1012 for (int col = 0; col < peptideLength; col++)
1014 char residue = peptide.getCharAt(col);
1016 if (Comparison.isGap(residue))
1018 cdsCol += CODON_LENGTH;
1023 int[] codon = mapList.locateInTo(proteinPos, proteinPos);
1026 // e.g. incomplete start codon, X in peptide
1027 cdsCol += CODON_LENGTH;
1031 for (int j = codon[0]; j <= codon[1]; j++)
1033 char mappedBase = cdsDss.getCharAt(j - cdsStart);
1034 alignedCds[cdsCol++] = mappedBase;
1042 * append stop codon if not mapped from protein,
1043 * closing it up to the end of the mapped sequence
1045 if (copiedBases == cdsLength - CODON_LENGTH)
1047 for (int i = alignedCds.length - 1; i >= 0; i--)
1049 if (!Comparison.isGap(alignedCds[i]))
1051 cdsCol = i + 1; // gap just after end of sequence
1055 for (int i = cdsLength - CODON_LENGTH; i < cdsLength; i++)
1057 alignedCds[cdsCol++] = cdsDss.getCharAt(i);
1060 cdsSeq.setSequence(new String(alignedCds));
1069 * Builds a map whose key is an aligned codon position (3 alignment column
1070 * numbers base 0), and whose value is a map from protein sequence to each
1071 * protein's peptide residue for that codon. The map generates an ordering of
1072 * the codons, and allows us to read off the peptides at each position in
1073 * order to assemble 'aligned' protein sequences.
1076 * the protein alignment
1078 * the coding dna alignment
1079 * @param unmappedProtein
1080 * any unmapped proteins are added to this list
1083 protected static Map<AlignedCodon, Map<SequenceI, AlignedCodon>> buildCodonColumnsMap(
1084 AlignmentI protein, AlignmentI dna,
1085 List<SequenceI> unmappedProtein)
1088 * maintain a list of any proteins with no mappings - these will be
1089 * rendered 'as is' in the protein alignment as we can't align them
1091 unmappedProtein.addAll(protein.getSequences());
1093 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
1096 * Map will hold, for each aligned codon position e.g. [3, 5, 6], a map of
1097 * {dnaSequence, {proteinSequence, codonProduct}} at that position. The
1098 * comparator keeps the codon positions ordered.
1100 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons = new TreeMap<>(
1101 new CodonComparator());
1103 for (SequenceI dnaSeq : dna.getSequences())
1105 for (AlignedCodonFrame mapping : mappings)
1107 SequenceI prot = mapping.findAlignedSequence(dnaSeq, protein);
1110 Mapping seqMap = mapping.getMappingForSequence(dnaSeq);
1111 addCodonPositions(dnaSeq, prot, protein.getGapCharacter(), seqMap,
1113 unmappedProtein.remove(prot);
1119 * Finally add any unmapped peptide start residues (e.g. for incomplete
1120 * codons) as if at the codon position before the second residue
1122 // TODO resolve JAL-2022 so this fudge can be removed
1123 int mappedSequenceCount = protein.getHeight() - unmappedProtein.size();
1124 addUnmappedPeptideStarts(alignedCodons, mappedSequenceCount);
1126 return alignedCodons;
1130 * Scans for any protein mapped from position 2 (meaning unmapped start
1131 * position e.g. an incomplete codon), and synthesizes a 'codon' for it at the
1132 * preceding position in the alignment
1134 * @param alignedCodons
1135 * the codon-to-peptide map
1136 * @param mappedSequenceCount
1137 * the number of distinct sequences in the map
1139 protected static void addUnmappedPeptideStarts(
1140 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1141 int mappedSequenceCount)
1143 // TODO delete this ugly hack once JAL-2022 is resolved
1144 // i.e. we can model startPhase > 0 (incomplete start codon)
1146 List<SequenceI> sequencesChecked = new ArrayList<>();
1147 AlignedCodon lastCodon = null;
1148 Map<SequenceI, AlignedCodon> toAdd = new HashMap<>();
1150 for (Entry<AlignedCodon, Map<SequenceI, AlignedCodon>> entry : alignedCodons
1153 for (Entry<SequenceI, AlignedCodon> sequenceCodon : entry.getValue()
1156 SequenceI seq = sequenceCodon.getKey();
1157 if (sequencesChecked.contains(seq))
1161 sequencesChecked.add(seq);
1162 AlignedCodon codon = sequenceCodon.getValue();
1163 if (codon.peptideCol > 1)
1166 "Problem mapping protein with >1 unmapped start positions: "
1169 else if (codon.peptideCol == 1)
1172 * first position (peptideCol == 0) was unmapped - add it
1174 if (lastCodon != null)
1176 AlignedCodon firstPeptide = new AlignedCodon(lastCodon.pos1,
1177 lastCodon.pos2, lastCodon.pos3,
1178 String.valueOf(seq.getCharAt(0)), 0);
1179 toAdd.put(seq, firstPeptide);
1184 * unmapped residue at start of alignment (no prior column) -
1185 * 'insert' at nominal codon [0, 0, 0]
1187 AlignedCodon firstPeptide = new AlignedCodon(0, 0, 0,
1188 String.valueOf(seq.getCharAt(0)), 0);
1189 toAdd.put(seq, firstPeptide);
1192 if (sequencesChecked.size() == mappedSequenceCount)
1194 // no need to check past first mapped position in all sequences
1198 lastCodon = entry.getKey();
1202 * add any new codons safely after iterating over the map
1204 for (Entry<SequenceI, AlignedCodon> startCodon : toAdd.entrySet())
1206 addCodonToMap(alignedCodons, startCodon.getValue(),
1207 startCodon.getKey());
1212 * Update the aligned protein sequences to match the codon alignments given in
1216 * @param alignedCodons
1217 * an ordered map of codon positions (columns), with sequence/peptide
1218 * values present in each column
1219 * @param unmappedProtein
1222 protected static int alignProteinAs(AlignmentI protein,
1223 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1224 List<SequenceI> unmappedProtein)
1227 * prefill peptide sequences with gaps
1229 int alignedWidth = alignedCodons.size();
1230 char[] gaps = new char[alignedWidth];
1231 Arrays.fill(gaps, protein.getGapCharacter());
1232 Map<SequenceI, char[]> peptides = new HashMap<>();
1233 for (SequenceI seq : protein.getSequences())
1235 if (!unmappedProtein.contains(seq))
1237 peptides.put(seq, Arrays.copyOf(gaps, gaps.length));
1242 * Traverse the codons left to right (as defined by CodonComparator)
1243 * and insert peptides in each column where the sequence is mapped.
1244 * This gives a peptide 'alignment' where residues are aligned if their
1245 * corresponding codons occupy the same columns in the cdna alignment.
1248 for (AlignedCodon codon : alignedCodons.keySet())
1250 final Map<SequenceI, AlignedCodon> columnResidues = alignedCodons
1252 for (Entry<SequenceI, AlignedCodon> entry : columnResidues.entrySet())
1254 char residue = entry.getValue().product.charAt(0);
1255 peptides.get(entry.getKey())[column] = residue;
1261 * and finally set the constructed sequences
1263 for (Entry<SequenceI, char[]> entry : peptides.entrySet())
1265 entry.getKey().setSequence(new String(entry.getValue()));
1272 * Populate the map of aligned codons by traversing the given sequence
1273 * mapping, locating the aligned positions of mapped codons, and adding those
1274 * positions and their translation products to the map.
1277 * the aligned sequence we are mapping from
1279 * the sequence to be aligned to the codons
1281 * the gap character in the dna sequence
1283 * a mapping to a sequence translation
1284 * @param alignedCodons
1285 * the map we are building up
1287 static void addCodonPositions(SequenceI dna, SequenceI protein,
1288 char gapChar, Mapping seqMap,
1289 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons)
1291 Iterator<AlignedCodon> codons = seqMap.getCodonIterator(dna, gapChar);
1294 * add codon positions, and their peptide translations, to the alignment
1295 * map, while remembering the first codon mapped
1297 while (codons.hasNext())
1301 AlignedCodon codon = codons.next();
1302 addCodonToMap(alignedCodons, codon, protein);
1303 } catch (IncompleteCodonException e)
1305 // possible incomplete trailing codon - ignore
1306 } catch (NoSuchElementException e)
1308 // possibly peptide lacking STOP
1314 * Helper method to add a codon-to-peptide entry to the aligned codons map
1316 * @param alignedCodons
1320 protected static void addCodonToMap(
1321 Map<AlignedCodon, Map<SequenceI, AlignedCodon>> alignedCodons,
1322 AlignedCodon codon, SequenceI protein)
1324 Map<SequenceI, AlignedCodon> seqProduct = alignedCodons.get(codon);
1325 if (seqProduct == null)
1327 seqProduct = new HashMap<>();
1328 alignedCodons.put(codon, seqProduct);
1330 seqProduct.put(protein, codon);
1334 * Returns true if a cDNA/Protein mapping either exists, or could be made,
1335 * between at least one pair of sequences in the two alignments. Currently,
1338 * <li>One alignment must be nucleotide, and the other protein</li>
1339 * <li>At least one pair of sequences must be already mapped, or mappable</li>
1340 * <li>Mappable means the nucleotide translation matches the protein
1342 * <li>The translation may ignore start and stop codons if present in the
1350 public static boolean isMappable(AlignmentI al1, AlignmentI al2)
1352 if (al1 == null || al2 == null)
1358 * Require one nucleotide and one protein
1360 if (al1.isNucleotide() == al2.isNucleotide())
1364 AlignmentI dna = al1.isNucleotide() ? al1 : al2;
1365 AlignmentI protein = dna == al1 ? al2 : al1;
1366 List<AlignedCodonFrame> mappings = protein.getCodonFrames();
1367 for (SequenceI dnaSeq : dna.getSequences())
1369 for (SequenceI proteinSeq : protein.getSequences())
1371 if (isMappable(dnaSeq, proteinSeq, mappings))
1381 * Returns true if the dna sequence is mapped, or could be mapped, to the
1389 protected static boolean isMappable(SequenceI dnaSeq,
1390 SequenceI proteinSeq, List<AlignedCodonFrame> mappings)
1392 if (dnaSeq == null || proteinSeq == null)
1397 SequenceI dnaDs = dnaSeq.getDatasetSequence() == null ? dnaSeq
1398 : dnaSeq.getDatasetSequence();
1399 SequenceI proteinDs = proteinSeq.getDatasetSequence() == null
1401 : proteinSeq.getDatasetSequence();
1403 for (AlignedCodonFrame mapping : mappings)
1405 if (proteinDs == mapping.getAaForDnaSeq(dnaDs))
1415 * Just try to make a mapping (it is not yet stored), test whether
1418 return mapCdnaToProtein(proteinDs, dnaDs) != null;
1422 * Finds any reference annotations associated with the sequences in
1423 * sequenceScope, that are not already added to the alignment, and adds them
1424 * to the 'candidates' map. Also populates a lookup table of annotation
1425 * labels, keyed by calcId, for use in constructing tooltips or the like.
1427 * @param sequenceScope
1428 * the sequences to scan for reference annotations
1429 * @param labelForCalcId
1430 * (optional) map to populate with label for calcId
1432 * map to populate with annotations for sequence
1434 * the alignment to check for presence of annotations
1436 public static void findAddableReferenceAnnotations(
1437 List<SequenceI> sequenceScope, Map<String, String> labelForCalcId,
1438 final Map<SequenceI, List<AlignmentAnnotation>> candidates,
1441 if (sequenceScope == null)
1447 * For each sequence in scope, make a list of any annotations on the
1448 * underlying dataset sequence which are not already on the alignment.
1450 * Add to a map of { alignmentSequence, <List of annotations to add> }
1452 for (SequenceI seq : sequenceScope)
1454 SequenceI dataset = seq.getDatasetSequence();
1455 if (dataset == null)
1459 AlignmentAnnotation[] datasetAnnotations = dataset.getAnnotation();
1460 if (datasetAnnotations == null)
1464 final List<AlignmentAnnotation> result = new ArrayList<>();
1465 for (AlignmentAnnotation dsann : datasetAnnotations)
1468 * Find matching annotations on the alignment. If none is found, then
1469 * add this annotation to the list of 'addable' annotations for this
1472 final Iterable<AlignmentAnnotation> matchedAlignmentAnnotations = al
1473 .findAnnotations(seq, dsann.getCalcId(), dsann.label);
1474 boolean found = false;
1475 if (matchedAlignmentAnnotations != null)
1477 for (AlignmentAnnotation matched : matchedAlignmentAnnotations)
1479 if (dsann.description.equals(matched.description))
1489 if (labelForCalcId != null)
1491 labelForCalcId.put(dsann.getCalcId(), dsann.label);
1496 * Save any addable annotations for this sequence
1498 if (!result.isEmpty())
1500 candidates.put(seq, result);
1506 * Adds annotations to the top of the alignment annotations, in the same order
1507 * as their related sequences. If you already have an annotation and want to
1508 * add it to a sequence in an alignment use {@code addReferenceAnnotationTo}
1510 * @param annotations
1511 * the annotations to add
1513 * the alignment to add them to
1514 * @param selectionGroup
1515 * current selection group - may be null, if provided then any added annotation will be trimmed to just those columns in the selection group
1517 public static void addReferenceAnnotations(
1518 Map<SequenceI, List<AlignmentAnnotation>> annotations,
1519 final AlignmentI alignment, final SequenceGroup selectionGroup)
1521 for (SequenceI seq : annotations.keySet())
1523 for (AlignmentAnnotation ann : annotations.get(seq))
1525 addReferenceAnnotationTo(alignment, seq, ann, selectionGroup);
1531 * Make a copy of a reference annotation {@code ann} and add it to an
1532 * alignment sequence {@code seq} in {@code alignment}, optionally limited to
1533 * the extent of {@code selectionGroup}
1538 * @param selectionGroup
1539 * current selection group - may be null, if provided then any added annotation will be trimmed to just those columns in the selection group
1540 * @return annotation added to {@code seq and {@code alignment}
1542 public static AlignmentAnnotation addReferenceAnnotationTo(
1543 final AlignmentI alignment, final SequenceI seq,
1544 final AlignmentAnnotation ann, final SequenceGroup selectionGroup)
1546 AlignmentAnnotation copyAnn = new AlignmentAnnotation(ann);
1548 int endRes = ann.annotations.length;
1549 if (selectionGroup != null)
1551 startRes = -1 + Math.min(seq.getEnd(), Math.max(seq.getStart(),
1552 seq.findPosition(selectionGroup.getStartRes())));
1553 endRes = -1 + Math.min(seq.getEnd(),
1554 seq.findPosition(selectionGroup.getEndRes()));
1557 copyAnn.restrict(startRes, endRes + 0);
1560 * Add to the sequence (sets copyAnn.datasetSequence), unless the
1561 * original annotation is already on the sequence.
1563 if (!seq.hasAnnotation(ann))
1565 ContactMatrixI cm = seq.getDatasetSequence().getContactMatrixFor(ann);
1568 seq.addContactListFor(copyAnn, cm);
1570 seq.addAlignmentAnnotation(copyAnn);
1573 copyAnn.adjustForAlignment();
1574 // add to the alignment and set visible
1575 alignment.addAnnotation(copyAnn);
1576 copyAnn.visible = true;
1582 * Set visibility of alignment annotations of specified types (labels), for
1583 * specified sequences. This supports controls like "Show all secondary
1584 * structure", "Hide all Temp factor", etc.
1586 * @al the alignment to scan for annotations
1588 * the types (labels) of annotations to be updated
1589 * @param forSequences
1590 * if not null, only annotations linked to one of these sequences are
1591 * in scope for update; if null, acts on all sequence annotations
1593 * if this flag is true, 'types' is ignored (label not checked)
1595 * if true, set visibility on, else set off
1597 public static void showOrHideSequenceAnnotations(AlignmentI al,
1598 Collection<String> types, List<SequenceI> forSequences,
1599 boolean anyType, boolean doShow)
1601 AlignmentAnnotation[] anns = al.getAlignmentAnnotation();
1604 for (AlignmentAnnotation aa : anns)
1606 if (anyType || types.contains(aa.label))
1608 if ((aa.sequenceRef != null) && (forSequences == null
1609 || forSequences.contains(aa.sequenceRef)))
1611 aa.visible = doShow;
1618 public static AlignmentAnnotation getFirstSequenceAnnotationOfType(
1619 AlignmentI al, int graphType)
1621 AlignmentAnnotation[] anns = al.getAlignmentAnnotation();
1624 for (AlignmentAnnotation aa : anns)
1626 if (aa.sequenceRef != null && aa.graph == graphType)
1634 * Returns true if either sequence has a cross-reference to the other
1640 public static boolean haveCrossRef(SequenceI seq1, SequenceI seq2)
1642 // Note: moved here from class CrossRef as the latter class has dependencies
1643 // not availability to the applet's classpath
1644 return hasCrossRef(seq1, seq2) || hasCrossRef(seq2, seq1);
1648 * Returns true if seq1 has a cross-reference to seq2. Currently this assumes
1649 * that sequence name is structured as Source|AccessionId.
1655 public static boolean hasCrossRef(SequenceI seq1, SequenceI seq2)
1657 if (seq1 == null || seq2 == null)
1661 String name = seq2.getName();
1662 final List<DBRefEntry> xrefs = seq1.getDBRefs();
1665 for (int ix = 0, nx = xrefs.size(); ix < nx; ix++)
1667 DBRefEntry xref = xrefs.get(ix);
1668 String xrefName = xref.getSource() + "|" + xref.getAccessionId();
1669 // case-insensitive test, consistent with DBRefEntry.equalRef()
1670 if (xrefName.equalsIgnoreCase(name))
1680 * Constructs an alignment consisting of the mapped (CDS) regions in the given
1681 * nucleotide sequences, and updates mappings to match. The CDS sequences are
1682 * added to the original alignment's dataset, which is shared by the new
1683 * alignment. Mappings from nucleotide to CDS, and from CDS to protein, are
1684 * added to the alignment dataset.
1687 * aligned nucleotide (dna or cds) sequences
1689 * the alignment dataset the sequences belong to
1691 * (optional) to restrict results to CDS that map to specified
1693 * @return an alignment whose sequences are the cds-only parts of the dna
1694 * sequences (or null if no mappings are found)
1696 public static AlignmentI makeCdsAlignment(SequenceI[] dna,
1697 AlignmentI dataset, SequenceI[] products)
1699 if (dataset == null || dataset.getDataset() != null)
1701 throw new IllegalArgumentException(
1702 "IMPLEMENTATION ERROR: dataset.getDataset() must be null!");
1704 List<SequenceI> foundSeqs = new ArrayList<>();
1705 List<SequenceI> cdsSeqs = new ArrayList<>();
1706 List<AlignedCodonFrame> mappings = dataset.getCodonFrames();
1707 HashSet<SequenceI> productSeqs = null;
1708 if (products != null)
1710 productSeqs = new HashSet<>();
1711 for (SequenceI seq : products)
1713 productSeqs.add(seq.getDatasetSequence() == null ? seq
1714 : seq.getDatasetSequence());
1719 * Construct CDS sequences from mappings on the alignment dataset.
1721 * - find the protein product(s) mapped to from each dna sequence
1722 * - if the mapping covers the whole dna sequence (give or take start/stop
1723 * codon), take the dna as the CDS sequence
1724 * - else search dataset mappings for a suitable dna sequence, i.e. one
1725 * whose whole sequence is mapped to the protein
1726 * - if no sequence found, construct one from the dna sequence and mapping
1727 * (and add it to dataset so it is found if this is repeated)
1729 for (SequenceI dnaSeq : dna)
1731 SequenceI dnaDss = dnaSeq.getDatasetSequence() == null ? dnaSeq
1732 : dnaSeq.getDatasetSequence();
1734 List<AlignedCodonFrame> seqMappings = MappingUtils
1735 .findMappingsForSequence(dnaSeq, mappings);
1736 for (AlignedCodonFrame mapping : seqMappings)
1738 List<Mapping> mappingsFromSequence = mapping
1739 .getMappingsFromSequence(dnaSeq);
1741 for (Mapping aMapping : mappingsFromSequence)
1743 MapList mapList = aMapping.getMap();
1744 if (mapList.getFromRatio() == 1)
1747 * not a dna-to-protein mapping (likely dna-to-cds)
1753 * skip if mapping is not to one of the target set of proteins
1755 SequenceI proteinProduct = aMapping.getTo();
1756 if (productSeqs != null && !productSeqs.contains(proteinProduct))
1762 * try to locate the CDS from the dataset mappings;
1763 * guard against duplicate results (for the case that protein has
1764 * dbrefs to both dna and cds sequences)
1766 SequenceI cdsSeq = findCdsForProtein(mappings, dnaSeq,
1767 seqMappings, aMapping);
1770 if (!foundSeqs.contains(cdsSeq))
1772 foundSeqs.add(cdsSeq);
1773 SequenceI derivedSequence = cdsSeq.deriveSequence();
1774 cdsSeqs.add(derivedSequence);
1775 if (!dataset.getSequences().contains(cdsSeq))
1777 dataset.addSequence(cdsSeq);
1784 * didn't find mapped CDS sequence - construct it and add
1785 * its dataset sequence to the dataset
1787 cdsSeq = makeCdsSequence(dnaSeq.getDatasetSequence(), aMapping,
1788 dataset).deriveSequence();
1789 // cdsSeq has a name constructed as CDS|<dbref>
1790 // <dbref> will be either the accession for the coding sequence,
1791 // marked in the /via/ dbref to the protein product accession
1792 // or it will be the original nucleotide accession.
1793 SequenceI cdsSeqDss = cdsSeq.getDatasetSequence();
1795 cdsSeqs.add(cdsSeq);
1798 * build the mapping from CDS to protein
1800 List<int[]> cdsRange = Collections
1801 .singletonList(new int[]
1802 { cdsSeq.getStart(),
1803 cdsSeq.getLength() + cdsSeq.getStart() - 1 });
1804 MapList cdsToProteinMap = new MapList(cdsRange,
1805 mapList.getToRanges(), mapList.getFromRatio(),
1806 mapList.getToRatio());
1808 if (!dataset.getSequences().contains(cdsSeqDss))
1811 * if this sequence is a newly created one, add it to the dataset
1812 * and made a CDS to protein mapping (if sequence already exists,
1813 * CDS-to-protein mapping _is_ the transcript-to-protein mapping)
1815 dataset.addSequence(cdsSeqDss);
1816 AlignedCodonFrame cdsToProteinMapping = new AlignedCodonFrame();
1817 cdsToProteinMapping.addMap(cdsSeqDss, proteinProduct,
1821 * guard against duplicating the mapping if repeating this action
1823 if (!mappings.contains(cdsToProteinMapping))
1825 mappings.add(cdsToProteinMapping);
1829 propagateDBRefsToCDS(cdsSeqDss, dnaSeq.getDatasetSequence(),
1830 proteinProduct, aMapping);
1832 * add another mapping from original 'from' range to CDS
1834 AlignedCodonFrame dnaToCdsMapping = new AlignedCodonFrame();
1835 final MapList dnaToCdsMap = new MapList(mapList.getFromRanges(),
1837 dnaToCdsMapping.addMap(dnaSeq.getDatasetSequence(), cdsSeqDss,
1839 if (!mappings.contains(dnaToCdsMapping))
1841 mappings.add(dnaToCdsMapping);
1845 * transfer dna chromosomal loci (if known) to the CDS
1846 * sequence (via the mapping)
1848 final MapList cdsToDnaMap = dnaToCdsMap.getInverse();
1849 transferGeneLoci(dnaSeq, cdsToDnaMap, cdsSeq);
1852 * add DBRef with mapping from protein to CDS
1853 * (this enables Get Cross-References from protein alignment)
1854 * This is tricky because we can't have two DBRefs with the
1855 * same source and accession, so need a different accession for
1856 * the CDS from the dna sequence
1859 // specific use case:
1860 // Genomic contig ENSCHR:1, contains coding regions for ENSG01,
1861 // ENSG02, ENSG03, with transcripts and products similarly named.
1862 // cannot add distinct dbrefs mapping location on ENSCHR:1 to ENSG01
1864 // JBPNote: ?? can't actually create an example that demonstrates we
1866 // synthesize an xref.
1868 List<DBRefEntry> primrefs = dnaDss.getPrimaryDBRefs();
1869 for (int ip = 0, np = primrefs.size(); ip < np; ip++)
1871 DBRefEntry primRef = primrefs.get(ip);
1873 * create a cross-reference from CDS to the source sequence's
1874 * primary reference and vice versa
1876 String source = primRef.getSource();
1877 String version = primRef.getVersion();
1878 DBRefEntry cdsCrossRef = new DBRefEntry(source,
1879 source + ":" + version, primRef.getAccessionId());
1881 .setMap(new Mapping(dnaDss, new MapList(cdsToDnaMap)));
1882 cdsSeqDss.addDBRef(cdsCrossRef);
1884 dnaSeq.addDBRef(new DBRefEntry(source, version,
1885 cdsSeq.getName(), new Mapping(cdsSeqDss, dnaToCdsMap)));
1886 // problem here is that the cross-reference is synthesized -
1887 // cdsSeq.getName() may be like 'CDS|dnaaccession' or
1889 // assuming cds version same as dna ?!?
1891 DBRefEntry proteinToCdsRef = new DBRefEntry(source, version,
1894 proteinToCdsRef.setMap(
1895 new Mapping(cdsSeqDss, cdsToProteinMap.getInverse()));
1896 proteinProduct.addDBRef(proteinToCdsRef);
1899 * transfer any features on dna that overlap the CDS
1901 transferFeatures(dnaSeq, cdsSeq, dnaToCdsMap, null,
1902 SequenceOntologyI.CDS);
1907 AlignmentI cds = new Alignment(
1908 cdsSeqs.toArray(new SequenceI[cdsSeqs.size()]));
1909 cds.setDataset(dataset);
1915 * Tries to transfer gene loci (dbref to chromosome positions) from fromSeq to
1916 * toSeq, mediated by the given mapping between the sequences
1919 * @param targetToFrom
1923 protected static void transferGeneLoci(SequenceI fromSeq,
1924 MapList targetToFrom, SequenceI targetSeq)
1926 if (targetSeq.getGeneLoci() != null)
1928 // already have - don't override
1931 GeneLociI fromLoci = fromSeq.getGeneLoci();
1932 if (fromLoci == null)
1937 MapList newMap = targetToFrom.traverse(fromLoci.getMapping());
1941 targetSeq.setGeneLoci(fromLoci.getSpeciesId(),
1942 fromLoci.getAssemblyId(), fromLoci.getChromosomeId(), newMap);
1947 * A helper method that finds a CDS sequence in the alignment dataset that is
1948 * mapped to the given protein sequence, and either is, or has a mapping from,
1949 * the given dna sequence.
1952 * set of all mappings on the dataset
1954 * a dna (or cds) sequence we are searching from
1955 * @param seqMappings
1956 * the set of mappings involving dnaSeq
1958 * a transcript-to-peptide mapping
1961 static SequenceI findCdsForProtein(List<AlignedCodonFrame> mappings,
1962 SequenceI dnaSeq, List<AlignedCodonFrame> seqMappings,
1966 * TODO a better dna-cds-protein mapping data representation to allow easy
1967 * navigation; until then this clunky looping around lists of mappings
1969 SequenceI seqDss = dnaSeq.getDatasetSequence() == null ? dnaSeq
1970 : dnaSeq.getDatasetSequence();
1971 SequenceI proteinProduct = aMapping.getTo();
1974 * is this mapping from the whole dna sequence (i.e. CDS)?
1975 * allowing for possible stop codon on dna but not peptide
1977 int mappedFromLength = MappingUtils
1978 .getLength(aMapping.getMap().getFromRanges());
1979 int dnaLength = seqDss.getLength();
1980 if (mappedFromLength == dnaLength
1981 || mappedFromLength == dnaLength - CODON_LENGTH)
1984 * if sequence has CDS features, this is a transcript with no UTR
1985 * - do not take this as the CDS sequence! (JAL-2789)
1987 if (seqDss.getFeatures().getFeaturesByOntology(SequenceOntologyI.CDS)
1995 * looks like we found the dna-to-protein mapping; search for the
1996 * corresponding cds-to-protein mapping
1998 List<AlignedCodonFrame> mappingsToPeptide = MappingUtils
1999 .findMappingsForSequence(proteinProduct, mappings);
2000 for (AlignedCodonFrame acf : mappingsToPeptide)
2002 for (SequenceToSequenceMapping map : acf.getMappings())
2004 Mapping mapping = map.getMapping();
2005 if (mapping != aMapping
2006 && mapping.getMap().getFromRatio() == CODON_LENGTH
2007 && proteinProduct == mapping.getTo()
2008 && seqDss != map.getFromSeq())
2010 mappedFromLength = MappingUtils
2011 .getLength(mapping.getMap().getFromRanges());
2012 if (mappedFromLength == map.getFromSeq().getLength())
2015 * found a 3:1 mapping to the protein product which covers
2016 * the whole dna sequence i.e. is from CDS; finally check the CDS
2017 * is mapped from the given dna start sequence
2019 SequenceI cdsSeq = map.getFromSeq();
2020 // todo this test is weak if seqMappings contains multiple mappings;
2021 // we get away with it if transcript:cds relationship is 1:1
2022 List<AlignedCodonFrame> dnaToCdsMaps = MappingUtils
2023 .findMappingsForSequence(cdsSeq, seqMappings);
2024 if (!dnaToCdsMaps.isEmpty())
2036 * Helper method that makes a CDS sequence as defined by the mappings from the
2037 * given sequence i.e. extracts the 'mapped from' ranges (which may be on
2038 * forward or reverse strand).
2043 * - existing dataset. We check for sequences that look like the CDS
2044 * we are about to construct, if one exists already, then we will
2045 * just return that one.
2046 * @return CDS sequence (as a dataset sequence)
2048 static SequenceI makeCdsSequence(SequenceI seq, Mapping mapping,
2052 * construct CDS sequence name as "CDS|" with 'from id' held in the mapping
2053 * if set (e.g. EMBL protein_id), else sequence name appended
2055 String mapFromId = mapping.getMappedFromId();
2056 final String seqId = "CDS|"
2057 + (mapFromId != null ? mapFromId : seq.getName());
2059 SequenceI newSeq = null;
2062 * construct CDS sequence by splicing mapped from ranges
2064 char[] seqChars = seq.getSequence();
2065 List<int[]> fromRanges = mapping.getMap().getFromRanges();
2066 int cdsWidth = MappingUtils.getLength(fromRanges);
2067 char[] newSeqChars = new char[cdsWidth];
2070 for (int[] range : fromRanges)
2072 if (range[0] <= range[1])
2074 // forward strand mapping - just copy the range
2075 int length = range[1] - range[0] + 1;
2076 System.arraycopy(seqChars, range[0] - 1, newSeqChars, newPos,
2082 // reverse strand mapping - copy and complement one by one
2083 for (int i = range[0]; i >= range[1]; i--)
2085 newSeqChars[newPos++] = Dna.getComplement(seqChars[i - 1]);
2089 newSeq = new Sequence(seqId, newSeqChars, 1, newPos);
2092 if (dataset != null)
2094 SequenceI[] matches = dataset.findSequenceMatch(newSeq.getName());
2095 if (matches != null)
2097 boolean matched = false;
2098 for (SequenceI mtch : matches)
2100 if (mtch.getStart() != newSeq.getStart())
2104 if (mtch.getEnd() != newSeq.getEnd())
2108 if (!Arrays.equals(mtch.getSequence(), newSeq.getSequence()))
2120 "JAL-2154 regression: warning - found (and ignored) a duplicate CDS sequence:"
2126 // newSeq.setDescription(mapFromId);
2132 * Adds any DBRefEntrys to cdsSeq from contig that have a Mapping congruent to
2133 * the given mapping.
2137 * @param proteinProduct
2139 * @return list of DBRefEntrys added
2141 protected static List<DBRefEntry> propagateDBRefsToCDS(SequenceI cdsSeq,
2142 SequenceI contig, SequenceI proteinProduct, Mapping mapping)
2145 // gather direct refs from contig congruent with mapping
2146 List<DBRefEntry> direct = new ArrayList<>();
2147 HashSet<String> directSources = new HashSet<>();
2149 List<DBRefEntry> refs = contig.getDBRefs();
2152 for (int ib = 0, nb = refs.size(); ib < nb; ib++)
2154 DBRefEntry dbr = refs.get(ib);
2156 if (dbr.hasMap() && (map = dbr.getMap().getMap()).isTripletMap())
2158 // check if map is the CDS mapping
2159 if (mapping.getMap().equals(map))
2162 directSources.add(dbr.getSource());
2167 List<DBRefEntry> onSource = DBRefUtils.selectRefs(
2168 proteinProduct.getDBRefs(),
2169 directSources.toArray(new String[0]));
2170 List<DBRefEntry> propagated = new ArrayList<>();
2172 // and generate appropriate mappings
2173 for (int ic = 0, nc = direct.size(); ic < nc; ic++)
2175 DBRefEntry cdsref = direct.get(ic);
2176 Mapping m = cdsref.getMap();
2177 // clone maplist and mapping
2178 MapList cdsposmap = new MapList(
2179 Arrays.asList(new int[][]
2180 { new int[] { cdsSeq.getStart(), cdsSeq.getEnd() } }),
2181 m.getMap().getToRanges(), 3, 1);
2182 Mapping cdsmap = new Mapping(m.getTo(), m.getMap());
2185 DBRefEntry newref = new DBRefEntry(cdsref.getSource(),
2186 cdsref.getVersion(), cdsref.getAccessionId(),
2187 new Mapping(cdsmap.getTo(), cdsposmap));
2189 // and see if we can map to the protein product for this mapping.
2190 // onSource is the filtered set of accessions on protein that we are
2191 // tranferring, so we assume accession is the same.
2192 if (cdsmap.getTo() == null && onSource != null)
2194 List<DBRefEntry> sourceRefs = DBRefUtils.searchRefs(onSource,
2195 cdsref.getAccessionId());
2196 if (sourceRefs != null)
2198 for (DBRefEntry srcref : sourceRefs)
2200 if (srcref.getSource().equalsIgnoreCase(cdsref.getSource()))
2202 // we have found a complementary dbref on the protein product, so
2203 // update mapping's getTo
2204 newref.getMap().setTo(proteinProduct);
2209 cdsSeq.addDBRef(newref);
2210 propagated.add(newref);
2216 * Transfers co-located features on 'fromSeq' to 'toSeq', adjusting the
2217 * feature start/end ranges, optionally omitting specified feature types.
2218 * Returns the number of features copied.
2223 * the mapping from 'fromSeq' to 'toSeq'
2225 * if not null, only features of this type are copied (including
2226 * subtypes in the Sequence Ontology)
2229 protected static int transferFeatures(SequenceI fromSeq, SequenceI toSeq,
2230 MapList mapping, String select, String... omitting)
2232 SequenceI copyTo = toSeq;
2233 while (copyTo.getDatasetSequence() != null)
2235 copyTo = copyTo.getDatasetSequence();
2237 if (fromSeq == copyTo || fromSeq.getDatasetSequence() == copyTo)
2239 return 0; // shared dataset sequence
2243 * get features, optionally restricted by an ontology term
2245 List<SequenceFeature> sfs = select == null
2246 ? fromSeq.getFeatures().getPositionalFeatures()
2247 : fromSeq.getFeatures().getFeaturesByOntology(select);
2250 for (SequenceFeature sf : sfs)
2252 String type = sf.getType();
2253 boolean omit = false;
2254 for (String toOmit : omitting)
2256 if (type.equals(toOmit))
2267 * locate the mapped range - null if either start or end is
2268 * not mapped (no partial overlaps are calculated)
2270 int start = sf.getBegin();
2271 int end = sf.getEnd();
2272 int[] mappedTo = mapping.locateInTo(start, end);
2274 * if whole exon range doesn't map, try interpreting it
2275 * as 5' or 3' exon overlapping the CDS range
2277 if (mappedTo == null)
2279 mappedTo = mapping.locateInTo(end, end);
2280 if (mappedTo != null)
2283 * end of exon is in CDS range - 5' overlap
2284 * to a range from the start of the peptide
2289 if (mappedTo == null)
2291 mappedTo = mapping.locateInTo(start, start);
2292 if (mappedTo != null)
2295 * start of exon is in CDS range - 3' overlap
2296 * to a range up to the end of the peptide
2298 mappedTo[1] = toSeq.getLength();
2301 if (mappedTo != null)
2303 int newBegin = Math.min(mappedTo[0], mappedTo[1]);
2304 int newEnd = Math.max(mappedTo[0], mappedTo[1]);
2305 SequenceFeature copy = new SequenceFeature(sf, newBegin, newEnd,
2306 sf.getFeatureGroup(), sf.getScore());
2307 copyTo.addSequenceFeature(copy);
2315 * Returns a mapping from dna to protein by inspecting sequence features of
2316 * type "CDS" on the dna. A mapping is constructed if the total CDS feature
2317 * length is 3 times the peptide length (optionally after dropping a trailing
2318 * stop codon). This method does not check whether the CDS nucleotide sequence
2319 * translates to the peptide sequence.
2325 public static MapList mapCdsToProtein(SequenceI dnaSeq,
2326 SequenceI proteinSeq)
2328 List<int[]> ranges = findCdsPositions(dnaSeq);
2329 int mappedDnaLength = MappingUtils.getLength(ranges);
2332 * if not a whole number of codons, truncate mapping
2334 int codonRemainder = mappedDnaLength % CODON_LENGTH;
2335 if (codonRemainder > 0)
2337 mappedDnaLength -= codonRemainder;
2338 MappingUtils.removeEndPositions(codonRemainder, ranges);
2341 int proteinLength = proteinSeq.getLength();
2342 int proteinStart = proteinSeq.getStart();
2343 int proteinEnd = proteinSeq.getEnd();
2346 * incomplete start codon may mean X at start of peptide
2347 * we ignore both for mapping purposes
2349 if (proteinSeq.getCharAt(0) == 'X')
2351 // todo JAL-2022 support startPhase > 0
2355 List<int[]> proteinRange = new ArrayList<>();
2358 * dna length should map to protein (or protein plus stop codon)
2360 int codesForResidues = mappedDnaLength / CODON_LENGTH;
2361 if (codesForResidues == (proteinLength + 1))
2363 // assuming extra codon is for STOP and not in peptide
2364 // todo: check trailing codon is indeed a STOP codon
2366 mappedDnaLength -= CODON_LENGTH;
2367 MappingUtils.removeEndPositions(CODON_LENGTH, ranges);
2370 if (codesForResidues == proteinLength)
2372 proteinRange.add(new int[] { proteinStart, proteinEnd });
2373 return new MapList(ranges, proteinRange, CODON_LENGTH, 1);
2379 * Returns a list of CDS ranges found (as sequence positions base 1), i.e. of
2380 * [start, end] positions of sequence features of type "CDS" (or a sub-type of
2381 * CDS in the Sequence Ontology). The ranges are sorted into ascending start
2382 * position order, so this method is only valid for linear CDS in the same
2383 * sense as the protein product.
2388 protected static List<int[]> findCdsPositions(SequenceI dnaSeq)
2390 List<int[]> result = new ArrayList<>();
2392 List<SequenceFeature> sfs = dnaSeq.getFeatures()
2393 .getFeaturesByOntology(SequenceOntologyI.CDS);
2398 SequenceFeatures.sortFeatures(sfs, true);
2400 for (SequenceFeature sf : sfs)
2405 String s = sf.getPhase();
2408 phase = Integer.parseInt(s);
2410 } catch (NumberFormatException e)
2415 * phase > 0 on first codon means 5' incomplete - skip to the start
2416 * of the next codon; example ENST00000496384
2418 int begin = sf.getBegin();
2419 int end = sf.getEnd();
2420 if (result.isEmpty() && phase > 0)
2425 // shouldn't happen!
2427 .println("Error: start phase extends beyond start CDS in "
2428 + dnaSeq.getName());
2431 result.add(new int[] { begin, end });
2435 * Finally sort ranges by start position. This avoids a dependency on
2436 * keeping features in order on the sequence (if they are in order anyway,
2437 * the sort will have almost no work to do). The implicit assumption is CDS
2438 * ranges are assembled in order. Other cases should not use this method,
2439 * but instead construct an explicit mapping for CDS (e.g. EMBL parsing).
2441 Collections.sort(result, IntRangeComparator.ASCENDING);
2446 * Makes an alignment with a copy of the given sequences, adding in any
2447 * non-redundant sequences which are mapped to by the cross-referenced
2453 * the alignment dataset shared by the new copy
2456 public static AlignmentI makeCopyAlignment(SequenceI[] seqs,
2457 SequenceI[] xrefs, AlignmentI dataset)
2459 AlignmentI copy = new Alignment(new Alignment(seqs));
2460 copy.setDataset(dataset);
2461 boolean isProtein = !copy.isNucleotide();
2462 SequenceIdMatcher matcher = new SequenceIdMatcher(seqs);
2465 // BH 2019.01.25 recoded to remove iterators
2467 for (int ix = 0, nx = xrefs.length; ix < nx; ix++)
2469 SequenceI xref = xrefs[ix];
2470 List<DBRefEntry> dbrefs = xref.getDBRefs();
2473 for (int ir = 0, nir = dbrefs.size(); ir < nir; ir++)
2475 DBRefEntry dbref = dbrefs.get(ir);
2476 Mapping map = dbref.getMap();
2478 if (map == null || (mto = map.getTo()) == null
2479 || mto.isProtein() != isProtein)
2483 SequenceI mappedTo = mto;
2484 SequenceI match = matcher.findIdMatch(mappedTo);
2487 matcher.add(mappedTo);
2488 copy.addSequence(mappedTo);
2498 * Try to align sequences in 'unaligned' to match the alignment of their
2499 * mapped regions in 'aligned'. For example, could use this to align CDS
2500 * sequences which are mapped to their parent cDNA sequences.
2502 * This method handles 1:1 mappings (dna-to-dna or protein-to-protein). For
2503 * dna-to-protein or protein-to-dna use alternative methods.
2506 * sequences to be aligned
2508 * holds aligned sequences and their mappings
2511 public static int alignAs(AlignmentI unaligned, AlignmentI aligned)
2514 * easy case - aligning a copy of aligned sequences
2516 if (alignAsSameSequences(unaligned, aligned))
2518 return unaligned.getHeight();
2522 * fancy case - aligning via mappings between sequences
2524 List<SequenceI> unmapped = new ArrayList<>();
2525 Map<Integer, Map<SequenceI, Character>> columnMap = buildMappedColumnsMap(
2526 unaligned, aligned, unmapped);
2527 int width = columnMap.size();
2528 char gap = unaligned.getGapCharacter();
2529 int realignedCount = 0;
2530 // TODO: verify this loop scales sensibly for very wide/high alignments
2532 for (SequenceI seq : unaligned.getSequences())
2534 if (!unmapped.contains(seq))
2536 char[] newSeq = new char[width];
2537 Arrays.fill(newSeq, gap); // JBPComment - doubt this is faster than the
2538 // Integer iteration below
2543 * traverse the map to find columns populated
2546 for (Integer column : columnMap.keySet())
2548 Character c = columnMap.get(column).get(seq);
2552 * sequence has a character at this position
2562 * trim trailing gaps
2564 if (lastCol < width)
2566 char[] tmp = new char[lastCol + 1];
2567 System.arraycopy(newSeq, 0, tmp, 0, lastCol + 1);
2570 // TODO: optimise SequenceI to avoid char[]->String->char[]
2571 seq.setSequence(String.valueOf(newSeq));
2575 return realignedCount;
2579 * If unaligned and aligned sequences share the same dataset sequences, then
2580 * simply copies the aligned sequences to the unaligned sequences and returns
2581 * true; else returns false
2584 * - sequences to be aligned based on aligned
2586 * - 'guide' alignment containing sequences derived from same dataset
2590 static boolean alignAsSameSequences(AlignmentI unaligned,
2593 if (aligned.getDataset() == null || unaligned.getDataset() == null)
2595 return false; // should only pass alignments with datasets here
2598 // map from dataset sequence to alignment sequence(s)
2599 Map<SequenceI, List<SequenceI>> alignedDatasets = new HashMap<>();
2600 for (SequenceI seq : aligned.getSequences())
2602 SequenceI ds = seq.getDatasetSequence();
2603 if (alignedDatasets.get(ds) == null)
2605 alignedDatasets.put(ds, new ArrayList<SequenceI>());
2607 alignedDatasets.get(ds).add(seq);
2611 * first pass - check whether all sequences to be aligned share a
2612 * dataset sequence with an aligned sequence; also note the leftmost
2613 * ungapped column from which to copy
2615 int leftmost = Integer.MAX_VALUE;
2616 for (SequenceI seq : unaligned.getSequences())
2618 final SequenceI ds = seq.getDatasetSequence();
2619 if (!alignedDatasets.containsKey(ds))
2623 SequenceI alignedSeq = alignedDatasets.get(ds).get(0);
2624 int startCol = alignedSeq.findIndex(seq.getStart()); // 1..
2625 leftmost = Math.min(leftmost, startCol);
2629 * second pass - copy aligned sequences;
2630 * heuristic rule: pair off sequences in order for the case where
2631 * more than one shares the same dataset sequence
2633 final char gapCharacter = aligned.getGapCharacter();
2634 for (SequenceI seq : unaligned.getSequences())
2636 List<SequenceI> alignedSequences = alignedDatasets
2637 .get(seq.getDatasetSequence());
2638 if (alignedSequences.isEmpty())
2641 * defensive check - shouldn't happen! (JAL-3536)
2645 SequenceI alignedSeq = alignedSequences.get(0);
2648 * gap fill for leading (5') UTR if any
2650 // TODO this copies intron columns - wrong!
2651 int startCol = alignedSeq.findIndex(seq.getStart()); // 1..
2652 int endCol = alignedSeq.findIndex(seq.getEnd());
2653 char[] seqchars = new char[endCol - leftmost + 1];
2654 Arrays.fill(seqchars, gapCharacter);
2655 char[] toCopy = alignedSeq.getSequence(startCol - 1, endCol);
2656 System.arraycopy(toCopy, 0, seqchars, startCol - leftmost,
2658 seq.setSequence(String.valueOf(seqchars));
2659 if (alignedSequences.size() > 0)
2661 // pop off aligned sequences (except the last one)
2662 alignedSequences.remove(0);
2667 * finally remove gapped columns (e.g. introns)
2669 new RemoveGapColCommand("", unaligned.getSequencesArray(), 0,
2670 unaligned.getWidth() - 1, unaligned);
2676 * Returns a map whose key is alignment column number (base 1), and whose
2677 * values are a map of sequence characters in that column.
2684 static SortedMap<Integer, Map<SequenceI, Character>> buildMappedColumnsMap(
2685 AlignmentI unaligned, AlignmentI aligned,
2686 List<SequenceI> unmapped)
2689 * Map will hold, for each aligned column position, a map of
2690 * {unalignedSequence, characterPerSequence} at that position.
2691 * TreeMap keeps the entries in ascending column order.
2693 SortedMap<Integer, Map<SequenceI, Character>> map = new TreeMap<>();
2696 * record any sequences that have no mapping so can't be realigned
2698 unmapped.addAll(unaligned.getSequences());
2700 List<AlignedCodonFrame> mappings = aligned.getCodonFrames();
2702 for (SequenceI seq : unaligned.getSequences())
2704 for (AlignedCodonFrame mapping : mappings)
2706 SequenceI fromSeq = mapping.findAlignedSequence(seq, aligned);
2707 if (fromSeq != null)
2709 Mapping seqMap = mapping.getMappingBetween(fromSeq, seq);
2710 if (addMappedPositions(seq, fromSeq, seqMap, map))
2712 unmapped.remove(seq);
2721 * Helper method that adds to a map the mapped column positions of a sequence.
2723 * For example if aaTT-Tg-gAAA is mapped to TTTAAA then the map should record
2724 * that columns 3,4,6,10,11,12 map to characters T,T,T,A,A,A of the mapped to
2728 * the sequence whose column positions we are recording
2730 * a sequence that is mapped to the first sequence
2732 * the mapping from 'fromSeq' to 'seq'
2734 * a map to add the column positions (in fromSeq) of the mapped
2738 static boolean addMappedPositions(SequenceI seq, SequenceI fromSeq,
2739 Mapping seqMap, Map<Integer, Map<SequenceI, Character>> map)
2747 * invert mapping if it is from unaligned to aligned sequence
2749 if (seqMap.getTo() == fromSeq.getDatasetSequence())
2751 seqMap = new Mapping(seq.getDatasetSequence(),
2752 seqMap.getMap().getInverse());
2755 int toStart = seq.getStart();
2758 * traverse [start, end, start, end...] ranges in fromSeq
2760 for (int[] fromRange : seqMap.getMap().getFromRanges())
2762 for (int i = 0; i < fromRange.length - 1; i += 2)
2764 boolean forward = fromRange[i + 1] >= fromRange[i];
2767 * find the range mapped to (sequence positions base 1)
2769 int[] range = seqMap.locateMappedRange(fromRange[i],
2773 System.err.println("Error in mapping " + seqMap + " from "
2774 + fromSeq.getName());
2777 int fromCol = fromSeq.findIndex(fromRange[i]);
2778 int mappedCharPos = range[0];
2781 * walk over the 'from' aligned sequence in forward or reverse
2782 * direction; when a non-gap is found, record the column position
2783 * of the next character of the mapped-to sequence; stop when all
2784 * the characters of the range have been counted
2786 while (mappedCharPos <= range[1] && fromCol <= fromSeq.getLength()
2789 if (!Comparison.isGap(fromSeq.getCharAt(fromCol - 1)))
2792 * mapped from sequence has a character in this column
2793 * record the column position for the mapped to character
2795 Map<SequenceI, Character> seqsMap = map.get(fromCol);
2796 if (seqsMap == null)
2798 seqsMap = new HashMap<>();
2799 map.put(fromCol, seqsMap);
2801 seqsMap.put(seq, seq.getCharAt(mappedCharPos - toStart));
2804 fromCol += (forward ? 1 : -1);
2811 // strictly temporary hack until proper criteria for aligning protein to cds
2812 // are in place; this is so Ensembl -> fetch xrefs Uniprot aligns the Uniprot
2813 public static boolean looksLikeEnsembl(AlignmentI alignment)
2815 for (SequenceI seq : alignment.getSequences())
2817 String name = seq.getName();
2818 if (!name.startsWith("ENSG") && !name.startsWith("ENST"))