Turkish word segmentation using morphological analyzer. - M. Oguzhan Külekci; Mehmed Özkan (INTERSPEECH, 2001)

Pronunciation Disambiguation in Turkish. - M. Oguzhan Külekci; Kemal Oflazer (ISCIS, 2005)

Statistical morphological disambiguation with application to disambiguation of pronunciations in Turkish (Biçimbirimsel belirsizliğin istatistiksel giderimi ve Türkçe okunuş belirsizliklerinin çözümünde uygulanması) - Muhammed Oguzhan Külekci (2006)

An Empirical Analysis of Pattern Scan Order in Pattern Matching. - M. Oguzhan Külekci (World Congress on Engineering, 2007)

A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching. - M. Oguzhan Külekci (ISAAC, 2008)

Filter Based Fast Matching of Long Patterns by Using SIMD Instructions. - M. Oguzhan Külekci (Stringology, 2009)

Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (BIBM, 2010)

PSI-RA: A parallel sparse index for read alignment on genomes. - M. Oguzhan Külekci; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter; Bojian Xu (BIBM, 2010)

Boosting Pattern Matching Performance via k-bit Filtering. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (ISCIS, 2010)

BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation. - M. Oguzhan Külekci (Math. Comput. Sci., 2010)

A Method to Ensure the Confidentiality of the Compressed Data. - M. Oguzhan Külekci (CCP, 2011)

Compressed Context Modeling for Text Compression. - M. Oguzhan Külekci (DCC, 2011)

On enumerating the DNA sequences. - M. Oguzhan Külekci (BCB, 2012)

Fast Multiple String Matching Using Streaming SIMD Extensions Technology. - Simone Faro; M. Oguzhan Külekci (SPIRE, 2012)

Fast Pattern-Matching via k-bit Filtering Based Text Decomposition. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (Comput. J., 2012)

On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression. - M. Oguzhan Külekci (Comput. Secur., 2012)

A memory versus compression ratio trade-off in PPM via compressed context modeling - M. Oguzhan Külekci (CoRR, 2012)

Enumeration of sequences with large alphabets - M. Oguzhan Külekci (CoRR, 2012)

Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Fast Packed String Matching for Short Patterns. - Simone Faro; M. Oguzhan Külekci (ALENEX, 2013)

Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. - M. Oguzhan Külekci (ISIT, 2013)

Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. - Simone Faro; M. Oguzhan Külekci (Stringology, 2013)

Shortest Unique Substring Query Revisited. - Atalay Mert Ileri; M. Oguzhan Külekci; Bojian Xu (CPM, 2014)

Enhanced Variable-Length Codes: Improved Compression with Efficient Random Access. - M. Oguzhan Külekci (DCC, 2014)

Fast and flexible packed string matching. - Simone Faro; M. Oguzhan Külekci (J. Discrete Algorithms, 2014)

Range Selection Queries in Data Aware Space and Time. - M. Oguzhan Külekci; Sharma V. Thankachan (DCC, 2015)

Nucleotide Sequence Alignment and Compression via Shortest Unique Substring. - Boran Adas; Ersin Bayraktar; Simone Faro; Ibraheem Elsayed Moustafa; M. Oguzhan Külekci (IWBBIO (2), 2015)

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (Stringology, 2015)

Alternative Algorithms for Order-Preserving Matching. - Tamanna Chhabra; M. Oguzhan Külekci; Jorma Tarhio (Stringology, 2015)

Huffman Codes versus Augmented Non-Prefix-Free Codes. - Boran Adas; Ersin Bayraktar; M. Oguzhan Külekci (SEA, 2015)

On Longest Repeat Queries. - Atalay Mert Ileri; M. Oguzhan Külekci; Bojian Xu (CoRR, 2015)

A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. - Atalay Mert Ileri; M. Oguzhan Külekci; Bojian Xu (Theor. Comput. Sci., 2015)

Efficient Algorithms for the Order Preserving Pattern Matching Problem. - Simone Faro; M. Oguzhan Külekci (AAIM, 2016)

GENCROBAT: Efficient transmission and processing of the massive genomic data. - M. Oguzhan Külekci; Mahmut Samil Sagiroglu (NOMS, 2016)

Inverse Range Selection Queries. - M. Oguzhan Külekci (SPIRE, 2016)

Security analysis on the ADS-B technology. - Eren Kocaaga; M. Oguzhan Külekci (SIU, 2017)

A System Architecture for Efficient Transmission of Massive DNA Sequencing Data. - Mahmut Samil Sagiroglu; M. Oguzhan Külekci (J. Comput. Biol., 2017)

Range selection and predecessor queries in data aware space and time. - M. Oguzhan Külekci; Sharma V. Thankachan (J. Discrete Algorithms, 2017)

Engineering order-preserving pattern matching with SIMD parallelism. - Tamanna Chhabra; Simone Faro; M. Oguzhan Külekci; Jorma Tarhio (Softw. Pract. Exp., 2017)

Non-Overlapping Indexing - Cache Obliviously. - Sahar Hooshmand; Paniz Abedin; M. Oguzhan Külekci; Sharma V. Thankachan (CPM, 2018)

Quality Assessment of High-Throughput DNA Sequencing Data via Range Analysis. - Ali Fotouhi; Mina Majidi; M. Oguzhan Külekci (IWBBIO (1), 2018)

Optimizing Packed String Matching on AVX2 Platform. - Mehmet Akif Aydogmus; M. Oguzhan Külekci (VECPAR, 2018)

An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes. - M. Oguzhan Külekci (SEA, 2018)

A Two-Level Scheme for Quality Score Compression. - Jan Voges; Ali Fotouhi; Jörn Ostermann; Muhammed Oguzhan Külekci (J. Comput. Biol., 2018)

Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave. - Can Kockan; Kaiyuan Zhu; Natnatee Dokmai; Nikolai Karpov; M. Oguzhan Külekci; David P. Woodruff; Süleyman Cenk Sahinalp (RECOMB, 2019)

Privacy-Preserving Text Similarity via Non-Prefix-Free Codes. - M. Oguzhan Külekci; Ismail Habib; Amir Aghabiglou (SISAP, 2019)

Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation. - Muhammed Oguzhan Külekci; Yasin Öztürk (Algorithms, 2019)

FM-Index Reveals the Reverse Suffix Array. - Arnab Ganguly 002; Daniel Gibney; Sahar Hooshmand; M. Oguzhan Külekci; Sharma V. Thankachan (CPM, 2020)

Shape-Preserving Pattern Matching. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (ICTCS, 2020)

Enumerative Data Compression with Non-Uniquely Decodable Codes. - M. Oguzhan Külekci; Yasin Öztürk; Elif Altunok; Can Yilmaz Altinigne (Stringology, 2020)

A Survey on Shortest Unique Substring Queries. - Paniz Abedin; M. Oguzhan Külekci; Sharma V. Thankachan (Algorithms, 2020)

The order-preserving pattern matching problem in practice. - Domenico Cantone; Simone Faro; M. Oguzhan Külekci (Discret. Appl. Math., 2020)

An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions. - Gözde Filiz; M. Oguzhan Külekci (CoRR, 2021)

I/O-efficient data structures for non-overlapping indexing. - Sahar Hooshmand; Paniz Abedin; M. Oguzhan Külekci; Sharma V. Thankachan (Theor. Comput. Sci., 2021)

Memory-Efficient FM-Index Construction for Reference Genomes. - Arghya Kusum Das; M. Oguzhan Külekci; Sharma V. Thankachan (BIBM, 2022)

Counting with Prediction: Rank and Select Queries with Adjusted Anchoring. - M. Oguzhan Külekci (DCC, 2022)

Tile Selection-based H.265/HEVC Coding. - Hakki Burak Çardak; Levent Çarkacioglu; Muhammed Oguzhan Külekci (SITIS, 2022)

Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation. - M. Oguzhan Külekci (COCOON (1), 2023)

Efficient Encodings for Privacy-Preserving Data Storage and Transmission. - Arghya Kusum Das; M. Oguzhan Külekci; Sharma V. Thankachan (IEEE Big Data, 2024)

An extended de Bruijn graph for feature engineering over biological sequential data. - Mert Onur Cakiroglu; Hasan Kurban; Parichit Sharma; M. Oguzhan Külekci; Elham Khorasani Buxton; Maryam Raeeszadeh-Sarmazdeh; Mehmet M. Dalkilic (Mach. Learn. Sci. Technol., 2024)