Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

Philip Bille, Morten Stöckel

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    String comparison such as sequence alignment, edit distance computation, longest common subsequence computation, and approximate string matching is a key task (and often computational bottleneck) in large-scale textual information retrieval. For instance, algorithms for sequence alignment are widely used in bioinformatics to compare DNA and protein sequences. These problems can all be solved using essentially the same dynamic programming scheme over a two-dimensional matrix, where each entry depends locally on at most 3 neighboring entries. We present a simple, fast, and cache-oblivious algorithm for this type of local dynamic programming suitable for comparing large-scale strings. Our algorithm outperforms the previous state-of-the-art solutions. Surprisingly, our new simple algorithm is competitive with a complicated, optimized, and tuned implementation of the best cache-aware algorithm. Additionally, our new algorithm generalizes the best known theoretical complexity trade-offs for the problem.
    Original languageEnglish
    Title of host publicationLanguage and Automata Theory and Applications : 6th International Conference, LATA 2012 A Coruña, Spain, March 5-9, 2012 Proceedings
    Publication date2012
    ISBN (Print)978-3-642-28331-4
    ISBN (Electronic)978-3-642-28332-1
    Publication statusPublished - 2012
    EventThe 6th International Conference on Language and Automata Theory and Applications, LATA - Coruña, Spain
    Duration: 5 Mar 20129 Mar 2012


    ConferenceThe 6th International Conference on Language and Automata Theory and Applications, LATA
    SeriesLecture Notes in Computer Science


    Dive into the research topics of 'Fast and Cache-Oblivious Dynamic Programming with Local Dependencies'. Together they form a unique fingerprint.

    Cite this