the score is the negative edit distance (i.e. 3 edit distance errors -> score of -3).
The algorithm was not invented by any SeqAn people but rather is described in Navarro's book:
Navarro, Gonzalo, and Matthieu Raffinot. Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002.
From: F M [firstname.lastname@example.org]
Sent: Monday, July 15, 2013 4:11 PM
Subject: [Seqan-dev] Appr. BNDM algorithm
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.