util

Documentation

Index

• func Levenshtein(s1, s2, a1, a2 string) (distance int)

Functions

func Levenshtein

func Levenshtein(s1, s2, a1, a2 string) (distance int)

Levenshtein computes the Levenshtein distance between two barcodes, or the number of insertions, deletions, and substitutions it takes to transform one barcode (s1) into another (s2). Each step in the transformation "costs" one distance point. Because a fixed number of barcode bases are always sequenced, bases downstream of the barcode will be read in the event of a deletion in the barcode sequence. To account for this situation, we take in the sequence downstream of both barcodes (a1 and a2). Note that s1 and s2 must have the same length.