DBScholar

Back to papers

RACE: A Scalable and Elastic Parallel System for Discovering Repeats in Very Long Sequences

Summary: RACE discovers maximal pairs in sequences too large for memory via a cache-efficient, parallel array design spanning multicore, clusters, and elastic clouds. A sampling-based cost model guides resource selection, enabling genome-scale analysis and dramatic speedups. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10936
Venue
VLDB
Year
2013
Pagerank
5.093636e-05
Overall Rank
12,297 | 15.64%
DOI
10.14778/2732977.2732979

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{mansour_vldb13,
        title = {{RACE: A Scalable and Elastic Parallel System for Discovering Repeats in Very Long Sequences}},
        author = {Mansour, Essam and El-Roby, Ahmed and Kalnis, Panos and Ahmadia, Aron and Aboulnaga, Ashraf},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {7},
        number = {12},
        pages = {865--876},
        doi = {10.14778/2732977.2732979},
        url = {https://doi.org/10.14778/2732977.2732979},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
3,077 Genome-scale Disk-based Suffix Tree Indexing 2007 SIGMOD 7.7810685e-05
5,242 Serial and Parallel Methods for I/O Efficient Suffix Tree Construction 2009 SIGMOD 6.3019356e-05
7,057 ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings 2012 VLDB 5.7159515e-05
Previous Page 1 / 1 Next

Semantically Similar Papers