M. Oguzhan Külekci

62 papers A 2B 15C 3Misc 5Journal 23Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Geometric-k-means: a bound free approach to fast and eco-friendly k-means.
Mach. Learn.
Parichit Sharma, Marcin Malec, Hasan Kurban, M. Oguzhan Külekci, Mehmet M. Dalkilic
2025 J jnl
Geometric-k-means: A Bound Free Approach to Fast and Eco-Friendly k-means.
CoRR
Parichit Sharma, Marcin Stanislaw, Hasan Kurban, M. Oguzhan Külekci, Mehmet M. Dalkilic
2024 J jnl
An extended de Bruijn graph for feature engineering over biological sequential data.
Mach. Learn. Sci. Technol.
Mert Onur Cakiroglu, Hasan Kurban, Parichit Sharma, M. Oguzhan Külekci, Elham Khorasani Buxton, Maryam Raeeszadeh-Sarmazdeh, Mehmet M. Dalkilic
2024 B conf
Efficient Encodings for Privacy-Preserving Data Storage and Transmission.
IEEE Big Data
Arghya Kusum Das, M. Oguzhan Külekci, Sharma V. Thankachan
2023 — conf
Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation.
COCOON (1)
M. Oguzhan Külekci
2022 B conf
Counting with Prediction: Rank and Select Queries with Adjusted Anchoring.
DCC
M. Oguzhan Külekci
2022 — conf
Memory-Efficient FM-Index Construction for Reference Genomes.
BIBM
Arghya Kusum Das, M. Oguzhan Külekci, Sharma V. Thankachan
2021 J jnl
An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions.
CoRR
Gözde Filiz, M. Oguzhan Külekci
2021 J jnl
I/O-efficient data structures for non-overlapping indexing.
Theor. Comput. Sci.
Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan
2020 J jnl
A Survey on Shortest Unique Substring Queries.
Algorithms
Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan
2020 Misc conf
Enumerative Data Compression with Non-Uniquely Decodable Codes.
PSC
M. Oguzhan Külekci, Yasin Öztürk, Elif Altunok, Can Yilmaz Altinigne
2020 B conf
FM-Index Reveals the Reverse Suffix Array.
CPM
Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan
2020 — conf
Shape-Preserving Pattern Matching.
ICTCS
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2020 J jnl
The order-preserving pattern matching problem in practice.
Discret. Appl. Math.
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2019 J jnl
Enumerative Data Compression with Non-Uniquely Decodable Codes.
CoRR
M. Oguzhan Külekci, Yasin Öztürk, Elif Altunok, Can Yilmaz Altinigne
2019 B conf
Privacy-Preserving Text Similarity via Non-Prefix-Free Codes.
SISAP
M. Oguzhan Külekci, Ismail Habib, Amir Aghabiglou
2019 B conf
Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave.
RECOMB
Can Kockan, Kaiyuan Zhu, Natnatee Dokmai, Nikolai Karpov, M. Oguzhan Külekci, David P. Woodruff, Süleyman Cenk Sahinalp
2018 B conf
An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes.
SEA
M. Oguzhan Külekci
2018 B conf
Non-Overlapping Indexing - Cache Obliviously.
CPM
Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan
2018 — conf
Optimizing Packed String Matching on AVX2 Platform.
VECPAR
Mehmet Akif Aydogmus, M. Oguzhan Külekci
2018 — conf
Quality Assessment of High-Throughput DNA Sequencing Data via Range Analysis.
IWBBIO (1)
Ali Fotouhi, Mina Majidi, M. Oguzhan Külekci
2017 J jnl
A System Architecture for Efficient Transmission of Massive DNA Sequencing Data.
J. Comput. Biol.
Mahmut Samil Sagiroglu, M. Oguzhan Külekci
2017 J jnl
Engineering order-preserving pattern matching with SIMD parallelism.
Softw. Pract. Exp.
Tamanna Chhabra, Simone Faro, M. Oguzhan Külekci, Jorma Tarhio
2017 J jnl
Range selection and predecessor queries in data aware space and time.
J. Discrete Algorithms
M. Oguzhan Külekci, Sharma V. Thankachan
2017 — conf
Security analysis on the ADS-B technology.
SIU
Eren Kocaaga, M. Oguzhan Külekci
2016 C conf
Efficient Algorithms for the Order Preserving Pattern Matching Problem.
AAIM
Simone Faro, M. Oguzhan Külekci
2016 B conf
GENCROBAT: Efficient transmission and processing of the massive genomic data.
NOMS
M. Oguzhan Külekci, Mahmut Samil Sagiroglu
2016 C conf
Inverse Range Selection Queries.
SPIRE
M. Oguzhan Külekci
2015 J jnl
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries.
Theor. Comput. Sci.
Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu
2015 Misc conf
Alternative Algorithms for Order-Preserving Matching.
PSC
Tamanna Chhabra, M. Oguzhan Külekci, Jorma Tarhio
2015 Misc conf
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem.
PSC
Domenico Cantone, Simone Faro, M. Oguzhan Külekci
2015 J jnl
Efficient Algorithms for the Order Preserving Pattern Matching Problem.
CoRR
Simone Faro, M. Oguzhan Külekci
2015 B conf
Huffman Codes versus Augmented Non-Prefix-Free Codes.
SEA
Boran Adas, Ersin Bayraktar, M. Oguzhan Külekci
2015 — conf
Nucleotide Sequence Alignment and Compression via Shortest Unique Substring.
IWBBIO (2)
Boran Adas, Ersin Bayraktar, Simone Faro, Ibraheem Elsayed Moustafa, M. Oguzhan Külekci
2015 J jnl
On Longest Repeat Queries.
CoRR
Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu
2015 B conf
Range Selection Queries in Data Aware Space and Time.
DCC
M. Oguzhan Külekci, Sharma V. Thankachan
2014 B conf
Enhanced Variable-Length Codes: Improved Compression with Efficient Random Access.
DCC
M. Oguzhan Külekci
2014 J jnl
Fast and flexible packed string matching.
J. Discrete Algorithms
Simone Faro, M. Oguzhan Külekci
2014 B conf
Shortest Unique Substring Query Revisited.
CPM
Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu
2013 A conf
Fast Packed String Matching for Short Patterns.
ALENEX
Simone Faro, M. Oguzhan Külekci
2013 J jnl
Shortest Unique Substring Query Revisited.
CoRR
Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu
2013 Misc conf
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns.
PSC
Simone Faro, M. Oguzhan Külekci
2013 B conf
Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees.
ISIT
M. Oguzhan Külekci
2012 J jnl
A memory versus compression ratio trade-off in PPM via compressed context modeling
CoRR
M. Oguzhan Külekci
2012 J jnl
Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree.
IEEE ACM Trans. Comput. Biol. Bioinform.
M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
2012 J jnl
Enumeration of sequences with large alphabets
CoRR
M. Oguzhan Külekci
2012 C conf
Fast Multiple String Matching Using Streaming SIMD Extensions Technology.
SPIRE
Simone Faro, M. Oguzhan Külekci
2012 J jnl
Fast Packed String Matching for Short Patterns
CoRR
Simone Faro, M. Oguzhan Külekci
2012 J jnl
Fast Pattern-Matching via
Comput. J.
M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
2012 — conf
On enumerating the DNA sequences.
BCB
M. Oguzhan Külekci
2012 J jnl
On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression.
Comput. Secur.
M. Oguzhan Külekci
2011 — conf
A Method to Ensure the Confidentiality of the Compressed Data.
CCP
M. Oguzhan Külekci
2011 B conf
Compressed Context Modeling for Text Compression.
DCC
M. Oguzhan Külekci
2010 J jnl
BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation.
Math. Comput. Sci.
M. Oguzhan Külekci
2010 — conf
Boosting Pattern Matching Performance via
ISCIS
M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
2010 — conf
PSI-RA: A parallel sparse index for read alignment on genomes.
BIBM
M. Oguzhan Külekci, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter, Bojian Xu
2010 — conf
Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees.
BIBM
M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
2009 Misc conf
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions.
PSC
M. Oguzhan Külekci
2008 B conf
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching.
ISAAC
M. Oguzhan Külekci
2007 — conf
An Empirical Analysis of Pattern Scan Order in Pattern Matching.
World Congress on Engineering
M. Oguzhan Külekci
2005 — conf
Pronunciation Disambiguation in Turkish.
ISCIS
M. Oguzhan Külekci, Kemal Oflazer
2001 A conf
Turkish word segmentation using morphological analyzer.
INTERSPEECH
M. Oguzhan Külekci, Mehmed Özkan