public class FindMatchByWordHash
Find Match by Words using a simple hashmap of fixed length word (kmers) to determine most similar sequence.
public int totalNumberOfTags()
Total number of tags (reference sequences)
public java.util.List<net.maizegenetics.dna.tag.Tag> getTags()
Returns a unmodifiable list of the tags (reference sequences)
public net.maizegenetics.analysis.rna.FindMatchByWordHash.Match match(java.lang.String seq)
Return the first unique kmer match found starting at the 5' end of the sequence.
seq - query sequence - usually the readspublic java.lang.String toString()
public static Tuple<java.lang.Integer,java.lang.Integer> calcIdentity(java.lang.String querySeq, java.lang.String refSeq)
public static int LevenshteinDistance(kotlin.Array[] s,
kotlin.Array[] t)
public static net.maizegenetics.analysis.rna.FindMatchByWordHash.Builder getBuilder(java.util.Set<net.maizegenetics.dna.tag.Tag> tagSet)