Examples with MatchFragmentNode de.ipbhalle.metfraglib.match.MatchFragmentNode used on opensource projects

Example 1 with MatchFragmentNode

use of de.ipbhalle.metfraglib.match.MatchFragmentNode in project MetFragRelaunched by ipb-halle.

the class HDTopDownFragmenterAssignerScorer method matchFragmentHD.

/**
 * @param tempPeakPointer
 * @param currentFragmentWrapper
 * @param tandemMassPeakList
 * @param sortedScoredPeaks
 * @param newToProcessFragments
 * @param peakIndexToPeakMatch
 * @param fragmentIndexToPeakMatch
 * @return
 */
protected boolean matchFragmentHD(int tempPeakPointer, HDTopDownBitArrayFragmentWrapper currentFragmentWrapper, SortedTandemMassPeakList tandemMassPeakList, java.util.HashMap<Integer, MatchFragmentList> peakIndexToPeakMatch, java.util.HashMap<Integer, MatchPeakList> fragmentIndexToPeakMatch, int precursorIndex) {
    byte matched = -1;
    boolean matchedAndAdded = false;
    while (matched != 1 && tempPeakPointer >= 0) {
        IMatch[] match = new IMatch[1];
        TandemMassPeak currentPeak = tandemMassPeakList.getElement(tempPeakPointer);
        /*
			 * calculate match
			 */
        if (tempPeakPointer >= 0)
            matched = currentFragmentWrapper.matchToPeak(this.candidates[0].getPrecursorMolecule(), currentPeak, this.precursorIonTypeIndexHD, this.positiveMode, match);
        /*
			 * check whether match has occurred
			 */
        if (matched == 0) {
            matchedAndAdded = true;
            currentFragmentWrapper.getWrappedFragment().setPrecursorFragments(true);
            Double[][] currentScores = this.scoreCollection.calculateSingleMatch(match[0]);
            /*
				 * insert fragment into peak's fragment list 
				 */
            /*
				 * first generate the new fragment node and set the score values
				 */
            MatchFragmentNode newNode = new MatchFragmentNode(match[0]);
            newNode.setScore(currentScores[0][0]);
            newNode.setFragmentScores(currentScores[0]);
            newNode.setOptimalValues(currentScores[1]);
            /*
				 * find correct location in the fragment list
				 */
            boolean similarFragmentFound = false;
            if (peakIndexToPeakMatch.containsKey(tempPeakPointer)) {
                Double[] values = peakIndexToPeakMatch.get(tempPeakPointer).containsByFingerprint(currentFragmentWrapper.getWrappedFragment().getAtomsFastBitArray());
                if (values == null) {
                    peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                } else {
                    if (values[0] < currentScores[0][0]) {
                        peakIndexToPeakMatch.get(tempPeakPointer).removeElementByID((int) Math.floor(values[1]));
                        fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).removeElementByID(tempPeakPointer);
                        if (fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).getRootNode() == null) {
                            fragmentIndexToPeakMatch.remove((int) Math.floor(values[1]));
                        }
                        peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                    } else
                        similarFragmentFound = true;
                }
            } else {
                MatchFragmentList newFragmentList = new MatchFragmentList(newNode);
                peakIndexToPeakMatch.put(tempPeakPointer, newFragmentList);
            }
            /*
				 * insert peak into fragment's peak list 
				 */
            if (!similarFragmentFound) {
                if (fragmentIndexToPeakMatch.containsKey(currentFragmentWrapper.getWrappedFragment().getID())) {
                    fragmentIndexToPeakMatch.get(currentFragmentWrapper.getWrappedFragment().getID()).insert(currentPeak, currentScores[0][0], tempPeakPointer);
                } else {
                    MatchPeakList newPeakList = new MatchPeakList(currentPeak, currentScores[0][0], tempPeakPointer);
                    fragmentIndexToPeakMatch.put(currentFragmentWrapper.getWrappedFragment().getID(), newPeakList);
                }
            }
        }
        /*
			 * if the mass of the current fragment was greater than the peak mass then assign the current peak ID to the peak IDs of the
			 * child fragments as they have smaller masses 
			 */
        if (matched == 1 || tempPeakPointer == 0) {
            /*
				 * mark current fragment for further fragmentation
				 */
            currentFragmentWrapper.setCurrentPeakIndexPointerHD(tempPeakPointer);
        }
        /*
			 * if the current fragment has matched to the current peak then set the current peak index to the next peak as the current fragment can 
			 * also match to the next peak
			 * if the current fragment mass was smaller than that of the current peak then set the current peak index to the next peak (reduce the index) 
			 * as the next peak mass is smaller and could match the current smaller fragment mass 
			 */
        if (matched == 0 || matched == -1)
            tempPeakPointer--;
    }
    return matchedAndAdded;
}

Example 2 with MatchFragmentNode

use of de.ipbhalle.metfraglib.match.MatchFragmentNode in project MetFragRelaunched by ipb-halle.

the class HDTopDownFragmenterAssignerScorer method calculateFragmenterScoresHD.

/**
 * @param peakIndexToPeakMatch
 * @param singleScores
 * @param summedScores
 */
protected void calculateFragmenterScoresHD(java.util.HashMap<Integer, MatchFragmentList> peakIndexToPeakMatchHD, double[][] singleScores, double[] summedScores, ICandidate candidate, int precursorID) {
    java.util.Iterator<Integer> it = peakIndexToPeakMatchHD.keySet().iterator();
    int index = 0;
    String sumFormulasOfFragmentsExplainedPeaks = "";
    String smilesOfFragmentsExplainedPeaks = "";
    while (it.hasNext()) {
        int key = it.next();
        MatchFragmentList matchFragmentList = peakIndexToPeakMatchHD.get(key);
        MatchFragmentNode bestFragment = matchFragmentList.getRootNode();
        IMatch match = bestFragment.getMatch();
        sumFormulasOfFragmentsExplainedPeaks += match.getMatchedPeak().getMass() + ":" + match.getModifiedFormulaStringOfBestMatchedFragment(candidate.getPrecursorMolecule()) + ";";
        // write out fragment smiles of HDX candidates if extended writer is set
        if (this.extendedWriter) {
            try {
                smilesOfFragmentsExplainedPeaks += match.getMatchedPeak().getMass() + ":" + MoleculeFunctions.getFragmentSmilesHD(this.candidates[precursorID].getPrecursorMolecule(), match.getBestMatchedFragment(), precursorID) + ";";
            } catch (CloneNotSupportedException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
        }
        Double[] scoreValuesSingleMatch = null;
        try {
            scoreValuesSingleMatch = bestFragment.getFragmentScores();
        } catch (Exception e) {
            matchFragmentList.printElements(candidate.getPrecursorMolecule());
            System.out.println(candidate.getIdentifier() + " " + key);
            return;
        }
        Double[] optimalValuesSingleMatch = bestFragment.getOptimalValues();
        for (int k = 1; k < scoreValuesSingleMatch.length; k++) {
            if (optimalValuesSingleMatch[k] != null)
                singleScores[k - 1][index] = optimalValuesSingleMatch[k];
            summedScores[k - 1] += scoreValuesSingleMatch[k];
        }
        if (bestFragment != null) {
            bestFragment.getFragment().setIsBestMatchedFragment(true);
            // match.initialiseBestMatchedFragment(0);
            MatchFragmentNode currentFragment = bestFragment;
            while (currentFragment.hasNext()) {
                MatchFragmentNode node = currentFragment.getNext();
                match.addToMatch(node.getMatch());
                currentFragment = currentFragment.getNext();
            }
        }
        index++;
    }
    if (sumFormulasOfFragmentsExplainedPeaks.length() != 0)
        sumFormulasOfFragmentsExplainedPeaks = sumFormulasOfFragmentsExplainedPeaks.substring(0, sumFormulasOfFragmentsExplainedPeaks.length() - 1);
    if (smilesOfFragmentsExplainedPeaks.length() != 0)
        smilesOfFragmentsExplainedPeaks = smilesOfFragmentsExplainedPeaks.substring(0, smilesOfFragmentsExplainedPeaks.length() - 1);
    candidate.setProperty("HDSmilesOfExplPeaks", smilesOfFragmentsExplainedPeaks);
    candidate.setProperty("HDFormulasOfExplPeaks", sumFormulasOfFragmentsExplainedPeaks);
    candidate.setProperty("HDNoExplPeaks", index);
}

Example 3 with MatchFragmentNode

use of de.ipbhalle.metfraglib.match.MatchFragmentNode in project MetFragRelaunched by ipb-halle.

the class HDTopDownFragmenterAssignerScorer method calculateFragmenterScores.

/**
 * @param peakIndexToPeakMatch
 * @param singleScores
 * @param summedScores
 */
protected void calculateFragmenterScores(java.util.HashMap<Integer, MatchFragmentList> peakIndexToPeakMatch, double[][] singleScores, double[] summedScores) {
    java.util.Iterator<Integer> it = peakIndexToPeakMatch.keySet().iterator();
    int index = 0;
    while (it.hasNext()) {
        int key = it.next();
        MatchFragmentList matchFragmentList = peakIndexToPeakMatch.get(key);
        MatchFragmentNode bestFragment = matchFragmentList.getRootNode();
        IMatch match = bestFragment.getMatch();
        Double[] scoreValuesSingleMatch = null;
        try {
            scoreValuesSingleMatch = bestFragment.getFragmentScores();
        } catch (Exception e) {
            matchFragmentList.printElements(this.candidates[0].getPrecursorMolecule());
            System.out.println(this.candidates[0].getIdentifier() + " " + key);
            return;
        }
        Double[] optimalValuesSingleMatch = bestFragment.getOptimalValues();
        for (int k = 1; k < scoreValuesSingleMatch.length; k++) {
            if (optimalValuesSingleMatch[k] != null)
                singleScores[k - 1][index] = optimalValuesSingleMatch[k];
            summedScores[k - 1] += scoreValuesSingleMatch[k];
        }
        if (bestFragment != null) {
            bestFragment.getFragment().setIsBestMatchedFragment(true);
            // match.initialiseBestMatchedFragment(0);
            this.matchList.addElementSorted(match);
            MatchFragmentNode currentFragment = bestFragment;
            while (currentFragment.hasNext()) {
                MatchFragmentNode node = currentFragment.getNext();
                match.addToMatch(node.getMatch());
                currentFragment = currentFragment.getNext();
            }
        }
        index++;
    }
}

Example 4 with MatchFragmentNode

use of de.ipbhalle.metfraglib.match.MatchFragmentNode in project MetFragRelaunched by ipb-halle.

the class HDTopDownFragmenterAssignerScorer method matchFragment.

/**
 * checks the match of the current fragment and returns the index of the next peak
 *
 * @param tempPeakPointer
 * @param currentFragmentWrapper
 * @param tandemMassPeakList
 * @param sortedScoredPeaks
 * @param newToProcessFragments
 * @param peakIndexToPeakMatch
 * @param fragmentIndexToPeakMatch
 * @return
 */
protected boolean matchFragment(int tempPeakPointer, HDTopDownBitArrayFragmentWrapper currentFragmentWrapper, SortedTandemMassPeakList tandemMassPeakList, java.util.HashMap<Integer, MatchFragmentList> peakIndexToPeakMatch, java.util.HashMap<Integer, MatchPeakList> fragmentIndexToPeakMatch) {
    byte matched = -1;
    boolean matchedAndAdded = false;
    while (matched != 1 && tempPeakPointer >= 0) {
        IMatch[] match = new IMatch[1];
        TandemMassPeak currentPeak = tandemMassPeakList.getElement(tempPeakPointer);
        /*
			 * calculate match
			 */
        if (tempPeakPointer >= 0) {
            matched = currentFragmentWrapper.getWrappedFragment().matchToPeak(this.candidates[0].getPrecursorMolecule(), currentPeak, this.precursorIonTypeIndex, this.positiveMode, match);
        }
        /*
			 * check whether match has occurred
			 */
        if (matched == 0) {
            currentFragmentWrapper.getWrappedFragment().setPrecursorFragments(true);
            Double[][] currentScores = this.scoreCollection.calculateSingleMatch(match[0]);
            /*
				 * first generate the new fragment node and set the score values
				 */
            MatchFragmentNode newNode = new MatchFragmentNode(match[0]);
            newNode.setScore(currentScores[0][0]);
            newNode.setFragmentScores(currentScores[0]);
            newNode.setOptimalValues(currentScores[1]);
            /*
				 * find correct location in the fragment list
				 */
            boolean similarFragmentFound = false;
            if (peakIndexToPeakMatch.containsKey(tempPeakPointer)) {
                Double[] values = peakIndexToPeakMatch.get(tempPeakPointer).containsByFingerprint(currentFragmentWrapper.getWrappedFragment().getAtomsFastBitArray());
                if (values == null) {
                    peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                } else {
                    if (values[0] < currentScores[0][0]) {
                        peakIndexToPeakMatch.get(tempPeakPointer).removeElementByID((int) Math.floor(values[1]));
                        fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).removeElementByID(tempPeakPointer);
                        if (fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).getRootNode() == null) {
                            fragmentIndexToPeakMatch.remove((int) Math.floor(values[1]));
                        }
                        peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                    } else
                        similarFragmentFound = true;
                }
            } else {
                MatchFragmentList newFragmentList = new MatchFragmentList(newNode);
                peakIndexToPeakMatch.put(tempPeakPointer, newFragmentList);
            }
            /*
				 * insert peak into fragment's peak list 
				 */
            if (!similarFragmentFound) {
                if (fragmentIndexToPeakMatch.containsKey(currentFragmentWrapper.getWrappedFragment().getID())) {
                    fragmentIndexToPeakMatch.get(currentFragmentWrapper.getWrappedFragment().getID()).insert(currentPeak, currentScores[0][0], tempPeakPointer);
                } else {
                    MatchPeakList newPeakList = new MatchPeakList(currentPeak, currentScores[0][0], tempPeakPointer);
                    fragmentIndexToPeakMatch.put(currentFragmentWrapper.getWrappedFragment().getID(), newPeakList);
                }
            }
        }
        /*
			 * if the mass of the current fragment was greater than the peak mass then assign the current peak ID to the peak IDs of the
			 * child fragments as they have smaller masses 
			 */
        if (matched == 1 || tempPeakPointer == 0) {
            /*
				 * mark current fragment for further fragmentation
				 */
            currentFragmentWrapper.setCurrentPeakIndexPointer(tempPeakPointer);
        }
        /*
			 * if the current fragment has matched to the current peak then set the current peak index to the next peak as the current fragment can 
			 * also match to the next peak
			 * if the current fragment mass was smaller than that of the current peak then set the current peak index to the next peak (reduce the index) 
			 * as the next peak mass is smaller and could match the current smaller fragment mass 
			 */
        if (matched == 0 || matched == -1)
            tempPeakPointer--;
    }
    return matchedAndAdded;
}

Example 5 with MatchFragmentNode

use of de.ipbhalle.metfraglib.match.MatchFragmentNode in project MetFragRelaunched by ipb-halle.

the class TopDownFragmenterAssignerScorer method calculate.

@Override
public void calculate() {
    AbstractTopDownBitArrayPrecursor candidatePrecursor = (AbstractTopDownBitArrayPrecursor) (this.candidates[0]).getPrecursorMolecule();
    // generate root fragment to start fragmentation
    AbstractTopDownBitArrayFragment root = candidatePrecursor.toFragment();
    Byte maximumTreeDepth = (Byte) settings.get(VariableNames.MAXIMUM_TREE_DEPTH_NAME);
    if (maximumTreeDepth == 0) {
        maximumTreeDepth = candidatePrecursor.getNumNodeDegreeOne() >= 4 ? (byte) 3 : (byte) 2;
    }
    this.candidates[0].setProperty(VariableNames.MAXIMUM_TREE_DEPTH_NAME, maximumTreeDepth);
    // read peaklist
    SortedTandemMassPeakList tandemMassPeakList = (SortedTandemMassPeakList) settings.get(VariableNames.PEAK_LIST_NAME);
    tandemMassPeakList.initialiseMassLimits((Double) this.settings.get(VariableNames.RELATIVE_MASS_DEVIATION_NAME), (Double) settings.get(VariableNames.ABSOLUTE_MASS_DEVIATION_NAME));
    Integer precursorIonType = (Integer) this.settings.get(VariableNames.PRECURSOR_ION_MODE_NAME);
    Boolean positiveMode = (Boolean) this.settings.get(VariableNames.IS_POSITIVE_ION_MODE_NAME);
    int precursorIonTypeIndex = Constants.ADDUCT_NOMINAL_MASSES.indexOf(precursorIonType);
    this.fragmenter.setMinimumFragmentMassLimit(this.fragmenter.getMinimumFragmentMassLimit() - Constants.ADDUCT_MASSES.get(precursorIonTypeIndex));
    /*
		 * prepare the processing
		 */
    java.util.Queue<AbstractTopDownBitArrayFragmentWrapper> toProcessFragments = new java.util.LinkedList<AbstractTopDownBitArrayFragmentWrapper>();
    /*
		 * wrap the root fragment
		 */
    AbstractTopDownBitArrayFragmentWrapper rootFragmentWrapper = new AbstractTopDownBitArrayFragmentWrapper(root, tandemMassPeakList.getNumberElements() - 1);
    toProcessFragments.add(rootFragmentWrapper);
    java.util.HashMap<Integer, MatchFragmentList> peakIndexToPeakMatch = new java.util.HashMap<Integer, MatchFragmentList>();
    java.util.HashMap<Integer, MatchPeakList> fragmentIndexToPeakMatch = new java.util.HashMap<Integer, MatchPeakList>();
    /*
		 * iterate over the maximal allowed tree depth
		 */
    for (int k = 1; k <= maximumTreeDepth; k++) {
        java.util.Queue<AbstractTopDownBitArrayFragmentWrapper> newToProcessFragments = new java.util.LinkedList<AbstractTopDownBitArrayFragmentWrapper>();
        /*
			 * use each fragment that is marked as to be processed
			 */
        while (!toProcessFragments.isEmpty()) {
            /*
				 * generate fragments of new tree depth
				 */
            AbstractTopDownBitArrayFragmentWrapper wrappedPrecursorFragment = toProcessFragments.poll();
            if (wrappedPrecursorFragment.getWrappedFragment().isDiscardedForFragmentation()) {
                AbstractTopDownBitArrayFragment clonedFragment = (AbstractTopDownBitArrayFragment) wrappedPrecursorFragment.getWrappedFragment().clone(candidatePrecursor);
                clonedFragment.setAsDiscardedForFragmentation();
                if (clonedFragment.getTreeDepth() < maximumTreeDepth)
                    newToProcessFragments.add(new AbstractTopDownBitArrayFragmentWrapper(clonedFragment, wrappedPrecursorFragment.getCurrentPeakIndexPointer()));
                continue;
            }
            /*
				 * generate fragments of next tree depth
				 */
            java.util.ArrayList<AbstractTopDownBitArrayFragment> fragmentsOfCurrentTreeDepth = this.fragmenter.getFragmentsOfNextTreeDepth(wrappedPrecursorFragment.getWrappedFragment());
            /*
				 * get peak pointer of current precursor fragment
				 */
            int currentPeakPointer = wrappedPrecursorFragment.getCurrentPeakIndexPointer();
            /*
				 * start loop over all child fragments from precursor fragment
				 * to try assigning them to the current peak
				 */
            for (int l = 0; l < fragmentsOfCurrentTreeDepth.size(); l++) {
                AbstractTopDownBitArrayFragment currentFragment = fragmentsOfCurrentTreeDepth.get(l);
                if (!fragmentsOfCurrentTreeDepth.get(l).isValidFragment()) {
                    if (currentFragment.getTreeDepth() < maximumTreeDepth)
                        newToProcessFragments.add(new AbstractTopDownBitArrayFragmentWrapper(fragmentsOfCurrentTreeDepth.get(l), currentPeakPointer));
                    continue;
                }
                if (this.wasAlreadyGeneratedByHashtable(currentFragment)) {
                    currentFragment.setAsDiscardedForFragmentation();
                    if (currentFragment.getTreeDepth() < maximumTreeDepth)
                        newToProcessFragments.add(new AbstractTopDownBitArrayFragmentWrapper(currentFragment, currentPeakPointer));
                    continue;
                }
                byte matched = -1;
                int tempPeakPointer = currentPeakPointer;
                while (matched != 1 && tempPeakPointer >= 0) {
                    IMatch[] match = new IMatch[1];
                    /*
						 * calculate match
						 */
                    matched = currentFragment.matchToPeak(candidatePrecursor, tandemMassPeakList.getElement(tempPeakPointer), precursorIonTypeIndex, positiveMode, match);
                    /*
						 * check whether match has occurred
						 */
                    if (matched == 0) {
                        currentFragment.setPrecursorFragments(true);
                        Double[][] currentScores = this.scoreCollection.calculateSingleMatch(match[0]);
                        /*
							 * insert fragment into peak's fragment list 
							 */
                        /*
							 * first generate the new fragment node and set the score values
							 */
                        MatchFragmentNode newNode = new MatchFragmentNode(match[0]);
                        newNode.setScore(currentScores[0][0]);
                        newNode.setFragmentScores(currentScores[0]);
                        newNode.setOptimalValues(currentScores[1]);
                        /*
							 * find correct location in the fragment list
							 */
                        boolean similarFragmentFound = false;
                        if (peakIndexToPeakMatch.containsKey(tempPeakPointer)) {
                            Double[] values = peakIndexToPeakMatch.get(tempPeakPointer).containsByFingerprint(currentFragment.getAtomsFastBitArray());
                            if (values == null) {
                                peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                            } else {
                                if (values[0] < currentScores[0][0]) {
                                    peakIndexToPeakMatch.get(tempPeakPointer).removeElementByID((int) Math.floor(values[1]));
                                    fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).removeElementByID(tempPeakPointer);
                                    if (fragmentIndexToPeakMatch.get((int) Math.floor(values[1])).getRootNode() == null) {
                                        fragmentIndexToPeakMatch.remove((int) Math.floor(values[1]));
                                    }
                                    peakIndexToPeakMatch.get(tempPeakPointer).insert(newNode);
                                } else
                                    similarFragmentFound = true;
                            }
                        } else {
                            MatchFragmentList newFragmentList = new MatchFragmentList(newNode);
                            peakIndexToPeakMatch.put(tempPeakPointer, newFragmentList);
                        }
                        /*
							 * insert peak into fragment's peak list 
							 */
                        if (!similarFragmentFound) {
                            if (fragmentIndexToPeakMatch.containsKey(currentFragment.getID())) {
                                fragmentIndexToPeakMatch.get(currentFragment.getID()).insert(tandemMassPeakList.getElement(tempPeakPointer), currentScores[0][0], tempPeakPointer);
                            } else {
                                MatchPeakList newPeakList = new MatchPeakList(tandemMassPeakList.getElement(tempPeakPointer), currentScores[0][0], tempPeakPointer);
                                fragmentIndexToPeakMatch.put(currentFragment.getID(), newPeakList);
                            }
                        }
                    }
                    /*
						 * if the mass of the current fragment was greater than the peak mass then assign the current peak ID to the peak IDs of the
						 * child fragments as they have smaller masses 
						 */
                    if (matched == 1 || tempPeakPointer == 0) {
                        /*
							 * mark current fragment for further fragmentation
							 */
                        if (currentFragment.getTreeDepth() < maximumTreeDepth)
                            newToProcessFragments.add(new AbstractTopDownBitArrayFragmentWrapper(currentFragment, tempPeakPointer));
                    }
                    /*
						 * if the current fragment has matched to the current peak then set the current peak index to the next peak as the current fragment can 
						 * also match to the next peak
						 * if the current fragment mass was smaller than that of the current peak then set the current peak index to the next peak (reduce the index) 
						 * as the next peak mass is smaller and could match the current smaller fragment mass 
						 */
                    if (matched == 0 || matched == -1)
                        tempPeakPointer--;
                }
            }
        }
        toProcessFragments = newToProcessFragments;
    }
    toProcessFragments.clear();
    this.matchList = new MatchList();
    /*
		 * collect score of all scores over all matches
		 */
    double[][] singleScores = new double[this.scoreCollection.getNumberScores()][peakIndexToPeakMatch.size()];
    /*
		 * collect the sum of all scores over all matches
		 */
    double[] summedScores = new double[this.scoreCollection.getNumberScores()];
    java.util.Iterator<Integer> it = peakIndexToPeakMatch.keySet().iterator();
    int index = 0;
    /*
		 * go over peak matches
		 */
    while (it.hasNext()) {
        int key = it.next();
        MatchFragmentList matchFragmentList = peakIndexToPeakMatch.get(key);
        MatchFragmentNode bestFragment = matchFragmentList.getRootNode();
        IMatch match = bestFragment.getMatch();
        Double[] scoreValuesSingleMatch = null;
        try {
            scoreValuesSingleMatch = bestFragment.getFragmentScores();
        } catch (Exception e) {
            matchFragmentList.printElements(this.candidates[0].getPrecursorMolecule());
            System.out.println(this.candidates[0].getIdentifier() + " " + key);
            System.exit(1);
        }
        Double[] optimalValuesSingleMatch = bestFragment.getOptimalValues();
        for (int k = 1; k < scoreValuesSingleMatch.length; k++) {
            if (optimalValuesSingleMatch[k] != null)
                singleScores[k - 1][index] = optimalValuesSingleMatch[k];
            summedScores[k - 1] += scoreValuesSingleMatch[k];
        }
        if (bestFragment != null) {
            bestFragment.getFragment().setIsBestMatchedFragment(true);
            // match.initialiseBestMatchedFragmentByFragmentID(bestFragment.getFragment().getID());
            this.matchList.addElementSorted(match);
            MatchFragmentNode currentFragment = bestFragment;
            while (currentFragment.hasNext()) {
                MatchFragmentNode node = currentFragment.getNext();
                match.addToMatch(node.getMatch());
                currentFragment = currentFragment.getNext();
            }
        }
        index++;
    }
    for (int i = 0; i < this.matchList.getNumberElements(); i++) this.matchList.getElement(i).shallowNullify();
    this.settings.set(VariableNames.MATCH_LIST_NAME, this.matchList);
    this.candidates[0].setMatchList(this.matchList);
    if (this.scoreCollection == null)
        return;
    try {
        for (int i = 0; i < this.scoreCollection.getNumberScores(); i++) {
            if (!this.scoreCollection.getScore(i).calculationFinished()) {
                this.scoreCollection.getScore(i).calculate();
            } else
                this.scoreCollection.getScore(i).setValue(summedScores[i]);
            if (singleScores[i].length != 0 && this.scoreCollection.getScore(i).hasInterimResults() && !this.scoreCollection.getScore(i).isInterimResultsCalculated()) {
                this.scoreCollection.getScore(i).setOptimalValues(singleScores[i]);
            }
        }
    } catch (Exception e) {
        e.printStackTrace();
        logger.warn("candidate score calculation interrupted");
        return;
    }
}