public class AggregatedSubHaplotypeFinder<F extends org.broadinstitute.hellbender.tools.walkers.haplotypecaller.graphs.KBestSubHaplotypeFinder>
extends java.lang.Object
Constructor and Description |
---|
AggregatedSubHaplotypeFinder(java.util.Collection<F> finders)
Creates a new aggregated sub-haplotype finder given its sub-finders.
|
Modifier and Type | Method and Description |
---|---|
int |
getCount()
Returns the total number of possible sub-haplotypes.
|
KBestHaplotype |
getKBest(int k)
Return the k-best sub-haplotype solution.
|
java.lang.String |
id()
Return an unique id for this sub-haplotype finder to be used when outputting diagrams.
|
boolean |
isReference()
Checks whether the top vertex for this finder is a reference haplotype vertex.
|
java.lang.String |
label()
Returns a label with human readable representation of this finder.
|
double |
score(byte[] bases,
int offset,
int length)
Calculate the score of a sequence of bases.
|
java.util.Set<org.apache.commons.lang3.tuple.Pair<? extends org.broadinstitute.hellbender.tools.walkers.haplotypecaller.graphs.KBestSubHaplotypeFinder,java.lang.String>> |
subFinderLabels()
Returns the set of subfinder from this finder together with a label for the connection with the current finder.
|
public AggregatedSubHaplotypeFinder(java.util.Collection<F> finders)
finders
- set of sub-finders.public java.lang.String id()
null
.public java.lang.String label()
This is used when generating a diagram to illustrate the search space and costs
null
.public java.util.Set<org.apache.commons.lang3.tuple.Pair<? extends org.broadinstitute.hellbender.tools.walkers.haplotypecaller.graphs.KBestSubHaplotypeFinder,java.lang.String>> subFinderLabels()
The label is used when generating a diagram to illustrate the search space and costs
public int getCount()
public double score(byte[] bases, int offset, int length)
bases
- array containing the query base sequence.offset
- first position of the query base sequence in bases
.length
- length of the query base sequence.Double.NaN
if there is no score for this sequence, otherwise a valid score value.public KBestHaplotype getKBest(int k)
k
- the requested solution rank.null
.public boolean isReference()
true
iff the top vertex for this finder is a reference vertex.