package
0.5.0
Repository: https://github.com/shenwei356/lexicmap.git
Documentation: pkg.go.dev

# Functions

ByteLengthUint32 returns the minimum number of bytes to store a integer.
ByteLengthUint64 returns the minimum number of bytes to store a integer.
CtrlByte2ByteLengthsUint32 returns the byte length for a given control byte.
CtrlByte2ByteLengthsUint64 returns the byte length for a given control byte.
https://gist.github.com/badboy/6267743 .
IsLowComplexity checks k-mer complexity according to the frequencies of 2-mer and 3-mer.
IsLowComplexity checks k-mer complexity with DUST algorithm.
KmerBaseAt returns the base in pos i (0-based).
KmerHasPrefix checks if a k-mer has a prefix.
KmerHasSuffix checks if a k-mer has a suffix.
KmerLongestPrefix returns the length of the longest prefix.
KmerPrefix returns the first n bases.
KmerSuffix returns the suffix starting from position i (0-based).
MustKmerHasPrefix checks if a k-mer has a prefix, by assuming k1>=k2.
MustKmerHasSuffix checks if a k-mer has a suffix, by assuming k1>=k2.
MustKmerLongestPrefix returns the length of the longest prefix.
MustSharingPrefixKmersMismatch counts the number of mismatch between two k-mers sharing with a p-bp prefix.
MustSharingPrefixKmersSuffixMatches counts the number of matches in the suffix region of two k-mers sharing with a p-bp prefix.
No description provided by the author
PutUint32s encodes four uint32s into 4-16 bytes, and returns control byte and encoded byte length.
PutUint64s encodes two uint64s into 2-16 bytes, and returns control byte and encoded byte length.
ReverseInts reverses a list of ints.
SharingPrefixKmersMismatch counts the number of mismatch between two k-mers sharing with a p-bp prefix.
SharingPrefixKmersMatches counts the number of matches in the suffix region of two k-mers sharing with a p-bp prefix.
Uint32s decodes encoded bytes.
Uint64s decodes encoded bytes.
UniqUint64s removes duplicates in a uint64 list.