M. Oğuzhan Külekçi
Computer Science · Indiana University
Publications
65
Citations
389
Est. group size
—
Recurring co-author estimate
Active years
20
Publishing since 2005
M. Oğuzhan Külekçi works on algorithms and data structures for efficiently storing, compressing, and searching large sequences of data, such as text and DNA. A recurring focus is on space-efficient indexing (methods that let you quickly search huge datasets while using little memory) and on privacy-preserving ways to encode and transmit data. Much of this work is applied to biological sequence data like genomes.
Publication activity was steady at around four to five papers per year through 2020, then slowed to roughly two to three per year in more recent years.
Generated by claude-opus-4-8 from public bibliographic data · Jul 11, 2026
- Efficient Encodings for Privacy-Preserving Data Storage and Transmission
2024
- An extended de Bruijn graph for feature engineering over biological sequential data
Machine Learning Science and Technology · 2024
- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation
Lecture notes in computer science · 2023
- A framework for assessing a country’s scientific productivity based on published articles by scientists affiliated with that country
Information Discovery and Delivery · 2023
- Counting with Prediction: Rank and Select Queries with Adjusted Anchoring
2022
- Memory–Efficient FM-Index Construction for Reference Genomes
2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · 2022
- Tile Selection-based H.265/HEVC Coding
2022
- AN EXPERIMENTAL ANALYSIS OF SPATIAL INDEXING ALGORITHMS FOR REAL TIME SAFETY CRITICAL MAP APPLICATION
ISPRS annals of the photogrammetry, remote sensing and spatial information sciences · 2021
- An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions
arXiv (Cornell University) · 2021
- A Survey on Shortest Unique Substring Queries
Algorithms · 2020
- I/O-efficient data structures for non-overlapping indexing
Theoretical Computer Science · 2020
- FM-Index Reveals the Reverse Suffix Array
Leibniz-Zentrum für Informatik (Schloss Dagstuhl) · 2020
- Shape-Preserving Pattern Matching.
Italian Conference on Theoretical Computer Science · 2020
- Sketching algorithms for genomic data analysis and querying in a secure enclave
Nature Methods · 2020
- Optimizing Packed String Matching on AVX2 Platform
Lecture notes in computer science · 2019
- Lecture notes in computer science×6
- Algorithms×2
- Journal of Computational Biology×2
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×2
- arXiv (Cornell University)×2
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 11, 2026.
Claim or correct this profile