Succinct and compressed data structures for string indexing and processing

Project: Research

Filter
Chapter

Search results

  • 2016

    Optimal bounds for computing α-gapped repeats

    Crochemore, M., Kolpakov, R. & Kucherov, G., 26 Feb 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer‐Verlag Berlin Heidelberg, Vol. 9618. p. 245-255 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9618).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

    17 Citations (Scopus)