Efficient and scalable pangenomes with the move structure
- Institution
- Johns Hopkins University, MD
- Principal investigator
- Benjamin Thomas Langmead
- Funding
- $200K
- Duration
- 2024–2026
Moonbase score
Still being scored
Abstract
PROJECT SUMMARY Pangenome references and indexes have been shown to alleviate the reference bias problem. Computer scientists recently described the novel “move structure,” which supports similar pattern-matching capabil- ities as the more typical r-index or F M -index structures, but with radically improved locality of reference. That is, move-structure algorithms access computer memory in a predictable way that minimizes cache misses, or other kinds of pauses due to data movement. We will adapt the “move structure” to the problem of pangenome indexing, enabling extremely and consistently fast pangenome queries. This will allow us to leverage inclusive and bias-avoiding pangenomes in applications where (a) we must keep up with a sequencer in real-time, e.g. nanopore sequencing, or (b) the index is so big that we must divide it across many computers, e.g. BLAST-like sequence classification.
LOADING MOONBASE SCORE
Questions for Johns Hopkins University
Answered by the team behind this research.
No questions yet. Sign in to ask the first one
Related grants
Same researchers, same institution, same topic, scored first.
- NIH · Johns Hopkins UniversityNot yet scored
Methods for sequencing data analysis and archive-scale data science
Benjamin Thomas Langmead · $514K · 2021–2025
- NIH · Johns Hopkins UniversityNot yet scored
Personal and panel references for improved alignment
Benjamin Thomas Langmead · $2.3M · 2020–2029
- NIH · Johns Hopkins University72
Development, Piloting and Dissemination of an Integrated Clinical and Social Multi-level Decision Support Platform to Address Social Determinants of Health Among Minority Populations in Baltimore City
Elham Hatef-Naimi · $611K · 2021–2025