Database Paper Browser

Back to papers

ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings

Summary: ERa enables disk-based suffix-tree construction for strings larger than memory via horizontal/vertical partitioning with adaptive I/O. Serial and parallel ERa variants index the human genome in 19 minutes on a desktop; the fastest prior method runs in 15 minutes on 1024 CPUs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10335
Venue
VLDB
Year
2012
Pagerank
5.1132714e-05
Overall Rank
6,319 | 56.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,250 Genome-scale Disk-based Suffix Tree Indexing 2007 SIGMOD 9.2009942e-05
2,583 Practical Suffix Tree Construction 2004 VLDB 8.497732e-05
4,550 Serial and Parallel Methods for I/O Efficient Suffix Tree Construction 2009 SIGMOD 6.0924864e-05
Previous Page 1 / 1 Next

Semantically Similar Papers