OpenAlex
PricingAboutJobs
Log inGet started
Work

Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs

HTML PDF

Year: 2013
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithms in Bioinformatics: 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings
DOI: 10.1007/978-3-642-40453-5_28
Authors: Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
Institutions: Lomonosov Moscow State University, Lyon 1 Université, Centre Inria de l'Université Grenoble Alpes, Laboratoire de Biométrie et Biologie Evolutive, Ben-Gurion University of the Negev, Centre National de la Recherche Scientifique, Paris-Est Sup, Laboratoire d'Informatique Gaspard-Monge, Université Paris-Est Marne-la-Vallée, Pôle de recherche et d'enseignement supérieur Université Paris-Est
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: de Bruijn graph, Bloom filter, memory reduction, next-generation sequencing data, query response time

Open Access status: green

Funder: Centre National de la Recherche Scientifique
OpenAlex ID: W2179064901
FWCI: 7.043
Cites: 16
Cited by: 59
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security