Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Inspired by this question on Suffix Trees, and the fabulous winning answer, I would hereby ask for a similar explanation of Myers' Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming.

share|cite|improve this question
    
I am very wary of such questions. There are things "plain English" is not sufficient for. – Raphael Dec 1 '12 at 14:31
    
The paper on Ukkonen's algorithm for building suffix trees in linear time is pretty complex too, but jogajapan managed to translate it to "plain English" beautifully. – maasha Dec 1 '12 at 19:16

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.