[Seqan-dev] Appr. BNDM algorithm

From: F M <flying.madden@gmail.com>
To: seqan-dev@lists.fu-berlin.de
Date: Mon, 15 Jul 2013 17:11:16 +0300
Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
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.

Best Regards,

Alp

http://docs.seqan.de/seqan/dev/SPEC_Abndm_Algo.html

<-- thread -->

<-- date -->

Follow-Ups:
- Re: [Seqan-dev] Appr. BNDM algorithm
  - From: "Holtgrewe, Manuel" <manuel.holtgrewe@fu-berlin.de>

seqan-dev - July 2013 - Archives indexes sorted by:
[ thread ] [ subject ] [ author ] [ date ]
Complete archive of the seqan-dev mailing list
More info on this list...