Bitpacking on CuriousCodinghttps://curiouscoding.nl/tags/bitpacking/Recent content in Bitpacking on CuriousCodingHugoenSun, 03 Sep 2023 00:00:00 +0200BitPAl bitpacking algorithmhttps://curiouscoding.nl/posts/bitpal/Sun, 03 Sep 2023 00:00:00 +0200https://curiouscoding.nl/posts/bitpal/Table of Contents Problem Input Example Discussion Found the bug Outlook The supplement (download) of the Loving, Hernandez, and Benson (2014) paper introduces a \(15\) operation version of Myers (1999) bitpacking algorithm, which uses \(16\) operations when modified for edit distance.
I tried implementing it, but it seems to have a bug that I will describe below. The fix is here.
Problem To recap, this algorithm solves the unit-cost edit distance problem by using bitpacking to compute a \(1\times w\) at a time.