M. Oguzhan Külekci

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 24

Top Topics

Pattern Matching

Efficient Data Structures

Top Venues

Publications

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