Burrows-wheeler Transform

The Burrows-Wheeler Transform is a reversible data transformation algorithm that permutes a string into runs of similar characters by lexicographically sorting all its cyclic rotations and extracting the last column of the resulting matrix, thereby enabling efficient compression and substring queries.

248

Publications

118.9K

Citations

476

Authors

260

Institutions

Publications per year

2017–2026

57

Authors

476

  1. GM
    Giovanni Manzini

    Università degli Studi del Piemonte Orientale “Amedeo Avogadro”, Italy

    12 publications · 1.7K citations

    11

    h-index

  2. GR
    Giovanna Rosone

    University of Palermo, Italy

    10 publications · 527 citations

    10

    h-index

  3. MS
    Marinella Sciortino

    University of Palermo, Italy

    7 publications · 493 citations

    7

    h-index

  4. PF
    Paolo Ferragina

    University of Pisa, Italy

    7 publications · 1.2K citations

    7

    h-index

  5. SV
    Sergio Verdú

    Princeton University, United States

    7 publications · 326 citations

    7

    h-index

1–5 of 476

Venues

  1. Bioinformatics

    30 publications · 81.6K citations

    21

    h-index

  2. Theoretical Computer Science

    16 publications · 720 citations

    13

    h-index

  3. BMC Bioinformatics

    9 publications · 301 citations

    9

    h-index

  4. bioRxiv (Cold Spring Harbor Laboratory)

    Repository · 9 publications · 245 citations

    9

    h-index

  5. Software Practice and Experience

    6 publications · 172 citations

    6

    h-index

1–5