RCSI: Scalable similarity search in thousand(s) of genomes
Summary: RCSI enables exact k-approximate read mapping over thousands of genomes by indexing a reference genome plus individual differences. On 1,092 human genomes, it delivers 450:1 compression and ~15-ms queries, with adaptive reference selection. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sebastian Wandelt (Humboldt University of Berlin)
- 2. Johannes Starlinger (Humboldt University of Berlin)
- 3. Marc Bux (Humboldt University of Berlin)
- 4. Ulf Leser (Humboldt University of Berlin)
BibTeX Citation
@article{wandelt_vldb13,
title = {{RCSI: Scalable similarity search in thousand(s) of genomes}},
author = {Wandelt, Sebastian and Starlinger, Johannes and Bux, Marc and Leser, Ulf},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {13},
pages = {1534--1545},
doi = {10.14778/2536258.2536265},
url = {https://doi.org/10.14778/2536258.2536265},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,154 | MRCSI: Compressing and Searching String Collections with Multiple References | 2015 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 975 | Can We Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search | 2012 | SIGMOD | 0.00012870645 |
| 2,459 | WHAM: A High-throughput Sequence Alignment Method | 2011 | SIGMOD | 8.550768e-05 |
| 3,446 | Efficient Approximate Entity Extraction with Edit Distance Constraints | 2009 | SIGMOD | 7.4087786e-05 |
| 6,182 | Reference-Based Alignment in Large Sequence Databases | 2009 | VLDB | 5.9493566e-05 |
| 6,858 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB | 5.7523396e-05 |
| 8,542 | Online Windowed Subsequence Matching over Probabilistic Sequences | 2012 | SIGMOD | 5.4119882e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,832 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD |
| 2 | 10,086 | Efficient and Effective KNN Sequence Search with Approximate n-grams | 2014 | VLDB |
| 3 | 3,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 4 | 3,486 | Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach | 2018 | VLDB |
| 5 | 2,519 | Similarity search in the blink of an eye with compressed indices | 2023 | VLDB |
| 6 | 3,077 | Genome-scale Disk-based Suffix Tree Indexing | 2007 | SIGMOD |
| 7 | 4,691 | Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO) | 2021 | SIGMOD |
| 8 | 6,182 | Reference-Based Alignment in Large Sequence Databases | 2009 | VLDB |
| 9 | 6,496 | Reference-Based Indexing of Sequence Databases | 2006 | VLDB |
| 10 | 12,154 | MRCSI: Compressing and Searching String Collections with Multiple References | 2015 | VLDB |