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
10
Paolo Ferragina, Roberto Grossi · Journal of the ACM · 1999 · 320 citations · Full text
Genome-scale disk-based suffix tree indexing
Benjarath Phoophakdee, Mohammed J. Zaki · 2007 · 96 citations
1–5 of 10
18
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 18
19

University of Pisa
Pisa, Italy
2 h-index
2 publications
394 citations

University of Helsinki
Helsinki, Finland
2 h-index
3 publications
31 citations

University of Victoria
Victoria, Canada
2 h-index
6 publications
81 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
134 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
11 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
11 citations
Max Planck Society
Munich, Germany
1 h-index
2 publications
148 citations
Rensselaer Polytechnic Institute
Troy, United States
1 h-index
2 publications
192 citations
1–8 of 19
JACM · 1 publications · 320 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 16 citations
1
h-index
AMB · 1 publications · 20 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
1–5