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
248
Fast and accurate short read alignment with Burrows–Wheeler transform
Heng Li, Richard Durbin · Bioinformatics · 2009 · 62.8K citations · Full text
Fast and accurate long-read alignment with Burrows–Wheeler transform
Heng Li, Richard Durbin · Bioinformatics · 2010 · 12.9K citations · Full text
SOAP2: an improved ultrafast tool for short read alignment
Ruiqiang Li, Chang Yu, Yingrui Li et al. · Bioinformatics · 2009 · 3.9K citations
1–5 of 248
476
Università degli Studi del Piemonte Orientale “Amedeo Avogadro”, Italy
12 publications · 1.7K citations
11
h-index
10
h-index
7
h-index
7
h-index
7
h-index
1–5 of 476
260

University of Pisa
Pisa, Italy
14 h-index
25 publications
2K citations

University of Palermo
Palermo, Italy
11 h-index
28 publications
2.2K citations

Università degli Studi del Piemonte Orientale “Amedeo Avogadro”
Vercelli, Italy
10 h-index
11 publications
1.7K citations

University of Central Florida
Orlando, United States
10 h-index
20 publications
434 citations

Wellcome Sanger Institute
Cambridge, United Kingdom
10 h-index
20 publications
154.3K citations

University of Helsinki
Helsinki, Finland
8 h-index
12 publications
919 citations
Princeton University
Princeton, United States
7 h-index
16 publications
799 citations
King's College London
London, United Kingdom
6 h-index
10 publications
232 citations
1–8 of 260
30 publications · 81.6K citations
21
h-index
16 publications · 720 citations
13
h-index
9 publications · 301 citations
9
h-index
Repository · 9 publications · 245 citations
9
h-index
6 publications · 172 citations
6
h-index
1–5