External Memory Suffix Trees

External Memory Suffix Trees is a data structure that extends the classical suffix tree to the external memory model by optimizing disk I/O complexity for indexing and querying massive strings stored in secondary storage.

10

Publications

633

Citations

18

Authors

19

Institutions

Publications per year

2017–2026

2

Authors

18

  1. PF
    Paolo Ferragina

    University of Pisa, Italy

    3 publications · 454 citations

    3

    h-index

  2. DK
    Dominik Kempa

    University of Helsinki, Finland

    2 publications · 25 citations

    2

    h-index

  3. AT
    Alex Thomo

    University of Victoria, Canada

    2 publications · 27 citations

    2

    h-index

  4. JK
    Juha Kärkkäinen

    University of Helsinki, Finland

    2 publications · 25 citations

    2

    h-index

  5. US
    Ulrike Stege

    University of Victoria, Canada

    2 publications · 27 citations

    2

    h-index

1–5 of 18

Venues

  1. Journal of the ACM

    JACM · 1 publications · 320 citations

    1

    h-index

  2. Software Practice and Experience

    1 publications · 11 citations

    1

    h-index

  3. Information Systems

    1 publications · 16 citations

    1

    h-index

  4. Algorithms for Molecular Biology

    AMB · 1 publications · 20 citations

    1

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 15 citations

    1

    h-index

1–5