C# 클래스 CanvasDiploidCaller.CanvasDiploidCaller

파일 보기 프로젝트 열기: Illumina/canvas 1 사용 예제들

공개 프로퍼티들

프로퍼티 타입 설명
CoverageWeighting double
IsDbsnpVcf bool
TempFolder string

보호된 프로퍼티들

프로퍼티 타입 설명
MeanCoverage float
MedianHetSnpsDistance int
MinimumVariantFrequenciesForInformativeSegment int

공개 메소드들

메소드 설명
AggregateCounts ( List &segments ) : float[]
AggregateVariantCoverage ( List &segments ) : int
CallVariants ( string variantFrequencyFile, string inFile, string outFile, string ploidyBedPath, string referenceFolder, string sampleName, string truthDataPath ) : int
InitializePloidies ( ) : void

Setup: Model various copy ploidies.

보호된 메소드들

메소드 설명
GetKnownCNForSegment ( CanvasSegment segment ) : int

Check whether we know the CN for this segment. Look for a known-CN interval that covers (at least half of) this segment. Return -1 if we don't know its CN.

GetProjectedMeanCoverage ( double diploidCoverage ) : double[]

Compute the expected bin counts for each copy number, given a specified bin count for CN=2 regions

InitializeModelPoints ( CoverageModel model ) : List

비공개 메소드들

메소드 설명
AssignPloidyCallsDistance ( CoverageModel model, List segments, int medianVariantCoverage ) : void
AssignPloidyCallsGaussianMixture ( ) : void

Assign a SegmentPloidy to each CanvasSegment, based on which model matches this segment best:

FitGaussians ( CoverageModel model, List segments, string debugPath = null ) : double

Fit a Gaussian mixture model. Fix the means to the model MAF and Coverage and run the EM algorithm until convergence. Compute the empirical MAF and Coverage. Fix the means to the empirical MAF and Coverage and run the EM algorithm again until convergence. Always estimate the full covariance matrix?

GenerateReportVersusKnownCN ( ) : void

Generate a table listing segments (and several features), and noting which are accurate (copy number exactly matches truth set) or directionally accurate (copy number and truth set are both <2, both =2, or both >2) This table will become our collection of feature vectors for training q-scores!

메소드 상세

AggregateCounts() 공개 정적인 메소드

public static AggregateCounts ( List &segments ) : float[]
segments List
리턴 float[]

AggregateVariantCoverage() 공개 정적인 메소드

public static AggregateVariantCoverage ( List &segments ) : int
segments List
리턴 int

CallVariants() 공개 메소드

public CallVariants ( string variantFrequencyFile, string inFile, string outFile, string ploidyBedPath, string referenceFolder, string sampleName, string truthDataPath ) : int
variantFrequencyFile string
inFile string
outFile string
ploidyBedPath string
referenceFolder string
sampleName string
truthDataPath string
리턴 int

GetKnownCNForSegment() 보호된 메소드

Check whether we know the CN for this segment. Look for a known-CN interval that covers (at least half of) this segment. Return -1 if we don't know its CN.
protected GetKnownCNForSegment ( CanvasSegment segment ) : int
segment CanvasCommon.CanvasSegment
리턴 int

GetProjectedMeanCoverage() 보호된 정적인 메소드

Compute the expected bin counts for each copy number, given a specified bin count for CN=2 regions
protected static GetProjectedMeanCoverage ( double diploidCoverage ) : double[]
diploidCoverage double
리턴 double[]

InitializeModelPoints() 보호된 메소드

protected InitializeModelPoints ( CoverageModel model ) : List
model CanvasCommon.CoverageModel
리턴 List

InitializePloidies() 공개 메소드

Setup: Model various copy ploidies.
public InitializePloidies ( ) : void
리턴 void

프로퍼티 상세

CoverageWeighting 공개적으로 정적으로 프로퍼티

public static double CoverageWeighting
리턴 double

IsDbsnpVcf 공개적으로 프로퍼티

public bool IsDbsnpVcf
리턴 bool

MeanCoverage 보호되어 있는 프로퍼티

protected float MeanCoverage
리턴 float

MedianHetSnpsDistance 보호되어 있는 프로퍼티

protected int MedianHetSnpsDistance
리턴 int

MinimumVariantFrequenciesForInformativeSegment 보호되어 있는 정적으로 프로퍼티

protected static int MinimumVariantFrequenciesForInformativeSegment
리턴 int

TempFolder 공개적으로 프로퍼티

public string TempFolder
리턴 string