default search action
Harun Mustafa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Nika Mansouri-Ghiasi, Mohammad Sadrosadati, Harun Mustafa
, Arvid Gollwitzer, Can Firtina, Julien Eudine, Haiyu Mao, Joël Lindegger, Meryem Banu Cavlak, Mohammed Alser, Jisung Park, Onur Mutlu:
MegIS: High-Performance, Energy-Efficient, and Low-Cost Metagenomic Analysis with In-Storage Processing. ISCA 2024: 660-677 - [i5]Nika Mansouri-Ghiasi, Mohammad Sadrosadati, Harun Mustafa
MegIS: High-Performance, Energy-Efficient, and Low-Cost Metagenomic Analysis with In-Storage Processing. CoRR abs/2406.19113 (2024) - 2023
- [i4]Nika Mansouri-Ghiasi, Mohammad Sadrosadati, Harun Mustafa, Arvid Gollwitzer, Can Firtina, Julien Eudine, Haiyu Mao, Joël Lindegger, Meryem Banu Cavlak, Mohammed Alser, Jisung Park, Onur Mutlu:
MetaStore: High-Performance Metagenomic Analysis via In-Storage Computing. CoRR abs/2311.12527 (2023) - 2022
- [b1]Harun Mustafa
Algorithms for efficient sensitive search and sample comparison on petabase-scale genomics data. ETH Zurich, Zürich, Switzerland, 2022 - [c6]Nika Mansouri-Ghiasi, Jisung Park
GenStore: a high-performance in-storage processing system for genome sequence analysis. ASPLOS 2022: 635-654 - [c5]Nika Mansouri-Ghiasi, Jisung Park, Harun Mustafa, Jeremie S. Kim, Ataberk Olgun, Arvid Gollwitzer
GenStore: In-Storage Filtering of Genomic Data for High-Performance and Energy-Efficient Genome Analysis. ISVLSI 2022: 283-287 - [c4]Mikhail Karasikov
Lossless Indexing with Counting de Bruijn Graphs. RECOMB 2022: 374-376 - [i3]Nika Mansouri-Ghiasi, Jisung Park, Harun Mustafa, Jeremie S. Kim, Ataberk Olgun, Arvid Gollwitzer, Damla Senol Cali, Can Firtina, Haiyu Mao, Nour Almadhoun Alserr, Rachata Ausavarungnirun, Nandita Vijaykumar, Mohammed Alser, Onur Mutlu:
GenStore: A High-Performance and Energy-Efficient In-Storage Computing System for Genome Sequence Analysis. CoRR abs/2202.10400 (2022) - 2021
- [j3]Daniel Danciu, Mikhail Karasikov, Harun Mustafa
Topology-based sparsification of graph annotations. Bioinform. 37(Supplement): 169-176 (2021) - 2020
- [j2]Mikhail Karasikov, Harun Mustafa
Sparse Binary Relation Representations for Genome Graph Annotation. J. Comput. Biol. 27(4): 626-639 (2020) - [c3]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS 2020: 1122-1132 - [c2]Pesho Ivanov
AStarix: Fast and Optimal Sequence-to-Graph Alignment. RECOMB 2020: 104-119
2010 – 2019
- 2019
- [j1]Harun Mustafa
Dynamic compression schemes for graph coloring. Bioinform. 35(3): 407-414 (2019) - [c1]Mikhail Karasikov
Sparse Binary Relation Representations for Genome Graph Annotation. RECOMB 2019: 120-135 - [i2]Andreas Georgiou, Vincent Fortuin, Harun Mustafa
Deep Multiple Instance Learning for Taxonomic Classification of Metagenomic read sets. CoRR abs/1909.13146 (2019) - [i1]Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik:
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR abs/1911.04200 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: