Giter Club home page Giter Club logo

Comments (1)

ACEnglish avatar ACEnglish commented on May 28, 2024

Picking matching parameters is more of an art than a science. It really depends on the precision of your callers and the tolerance you wish to allow them such that it is a fair comparison.

For example, depth of coverage callers (such as CNVnator) will have very 'fuzzy' boundaries, and don't report the exact deleted sequence but only varying regions. So thresholds of pctsim==0, pctsize==.5, pctovl==.5, refdist==1000 may seem fair.

Spiral Genetics' BioGraph Discovery reports precise breakpoints and full alternate allele sequences, so when benchmarking those results, we want to ensure our accuracy by using the stricter default thresholds. I also use defaults when doing a benchmark comparison to tools like Manta.

If you're still having trouble picking thresholds, it may be beneficial to do a few runs of truvari over different values. Start with the strict defaults and gradually increase the leniency. From there, you can look at the performance metrics and manually inspect differences between the runs to find out what level you find acceptable. I built truvari to be flexible in this manner, but more importantly, truvari helps one clearly report the thresholds used for reproducibility (see the json at the top of your log.txt).

If you're curious for more details on what these specific parameters mean, you can see all the implementation details pulled from the code below. Also, I've recently expanded the documentation in the README for detail aboutpctsim. See the section Comparing Haplotype Sequences of Variants. For more details on the Levenshtein distance ratio, see https://stackabuse.com/levenshtein-distance-and-text-similarity-in-python/

#pctsize
def var_sizesim(sizeA, sizeB):
    """
    Calculate the size similarity pct for the two entries
    compares the longer of entryA's two alleles (REF or ALT)
    """
    return min(sizeA, sizeB) / float(max(sizeA, sizeB)), sizeA - sizeB
#pctovl
def get_rec_ovl(astart, aend, bstart, bend):
    """
    Compute reciprocal overlap between two spans
    """
    ovl_start = max(astart, bstart)
    ovl_end = min(aend, bend)
    if ovl_start < ovl_end:  # Otherwise, they're not overlapping
        ovl_pct = float(ovl_end - ovl_start) / max(aend - astart, bend - bstart)
    else:
        ovl_pct = 0
    return ovl_pct

For refdist we only consider matching comparison calls within REFDIST base-pairs upstream of the base call's start position and REFDIST base-pairs downstream of the base calls' end position.

from truvari.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.