include/semiGappedScoring.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
int4	semiGappedScoring_score (struct ungappedExtension *ungappedExtension, struct PSSMatrix PSSMatrix, int4 subjectSize, unsigned char *subject, int4 dropoff)
void	semiGappedScoring_free ()

---

Function Documentation

void semiGappedScoring_free

(

)

Definition at line 1147 of file semiGappedScoring.c.

References semiGappedScoring_bestRow, and semiGappedScoring_insertQrow.

Referenced by main().

{
    free(semiGappedScoring_bestRow);
    free(semiGappedScoring_insertQrow);
}

Here is the caller graph for this function:

int4 semiGappedScoring_score	(	struct ungappedExtension *	ungappedExtension,
		struct PSSMatrix	PSSMatrix,
		int4	subjectSize,
		unsigned char *	subject,
		int4	dropoff
	)

Definition at line 24 of file semiGappedScoring.c.

References dpResults::best, dpResults::bestScore, blast_numSemiGapped, ungappedExtension::end, int4, PSSMatrix::length, PSSMatrix::matrix, oldSemiGappedScoring_score(), parameters_restrictedInsertionScoring, parameters_semiGappedDropoffIncrease, PSSMatrix_chop(), coordinate::queryOffset, ungappedExtension::seed, semiGappedScoring_dpAfterSeed(), semiGappedScoring_dpBeforeSeed(), ungappedExtension::start, PSSMatrix::strandLength, and coordinate::subjectOffset.

Referenced by alignments_findGoodAlignments().

{
    struct coordinate seed;
    unsigned char *choppedSubject;
    struct PSSMatrix choppedPSSMatrix;
    int4 choppedSubjectSize;
    struct dpResults beforeDpResults, afterDpResults;
    int4 strandOffset = 0;

    // Increment counter number of HSP's semi-gapped
        blast_numSemiGapped++;

    // Use old code if restricted insertion has been disabled
    if (!parameters_restrictedInsertionScoring)
    {
        return oldSemiGappedScoring_score(ungappedExtension, PSSMatrix, subjectSize, subject, dropoff);
    }

    // Perform dynamic programming for points before the seed
    seed = ungappedExtension->seed;
    if (seed.queryOffset > PSSMatrix.strandLength)
    {
            // If query position is in the second strand, remove first strand from PSSM
        strandOffset = PSSMatrix.strandLength;
                seed.queryOffset -= PSSMatrix.strandLength;
                PSSMatrix = PSSMatrix_chop(PSSMatrix, PSSMatrix.strandLength);
    }
    else
    {
        // Otherwise remove second strand
        PSSMatrix.length = PSSMatrix.strandLength;
    }

    beforeDpResults = semiGappedScoring_dpBeforeSeed(subject, PSSMatrix,
                    seed, dropoff + parameters_semiGappedDropoffIncrease);

    // Chop the start off the query and subject so they begin at the seed
    choppedPSSMatrix = PSSMatrix_chop(PSSMatrix, seed.queryOffset);
    choppedSubject = subject + seed.subjectOffset;
    choppedSubjectSize = subjectSize - seed.subjectOffset;

    // Perform dynamic programming for points after the seed
    afterDpResults = semiGappedScoring_dpAfterSeed(choppedSubject, choppedPSSMatrix,
                    dropoff + parameters_semiGappedDropoffIncrease, choppedSubjectSize);

    // Re-adjust result change due to chopping subject/query and strand adjustment
    afterDpResults.best.queryOffset += seed.queryOffset + strandOffset;
    afterDpResults.best.subjectOffset += seed.subjectOffset;
    beforeDpResults.best.queryOffset += strandOffset;

    // Associate best scoring start and end points with the ungapped extension
    ungappedExtension->start = beforeDpResults.best;
    ungappedExtension->end = afterDpResults.best;

//    if (dloc == 88197331)
//        printf("semiGapped[%d,%d,%d]\n", beforeDpResults.bestScore, afterDpResults.bestScore,
//        choppedPSSMatrix.matrix[0][choppedSubject[0]]);

    // Determine score by combining score from the two traces, and the match score at
    // the seed position
    return beforeDpResults.bestScore + afterDpResults.bestScore +
           choppedPSSMatrix.matrix[0][choppedSubject[0]];
}

Here is the call graph for this function:

Here is the caller graph for this function:

---