Hello, as a phd student curious to learn string matching algorithm implementations, I have been checking seqan tutorials since this morning :)
my question is how is Approximate Backward Nondeterministic Dawg Matching implemented? How does scoring work? What kind of metric is this? Is there a research paper that explains the inner details? Thank you.