Database Paper Browser

Back to papers

Serial and Parallel Methods for I/O Efficient Suffix Tree Construction

Summary: Suffix-tree construction re-architected as a tiled, constant-working-set workflow for I/O-efficient scaling beyond main memory. On massively parallel platforms (Blue Gene/L), locality-aware design and efficient communication yield major speedups, indexing the human genome on 1024 CPUs in under 15 minutes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4167
Venue
SIGMOD
Year
2009
Pagerank
6.0924864e-05
Overall Rank
4,550 | 68.35%
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
1,118 A Database Index to Large Biological Sequences 2001 VLDB 0.00013879121
2,250 Genome-scale Disk-based Suffix Tree Indexing 2007 SIGMOD 9.2009942e-05
2,497 OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences 2003 VLDB 8.6472036e-05
Previous Page 1 / 1 Next

Semantically Similar Papers