M. Oguzhan Külekci
M. Oguzhan Külekci
Istanbul Technical University, Informatics Institute
Verified email at acm.org - Homepage
Cited by
Cited by
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions.
MO Külekci
Stringology, 118-128, 2009
Fast packed string matching for short patterns
S Faro, MO Külekci
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
Fast multiple string matching using streaming SIMD extensions technology
S Faro, MO Külekci
International Symposium on String Processing and Information Retrieval, 217-228, 2012
Efficient maximal repeat finding using the burrows-wheeler transform and wavelet tree
MO Kulekci, JS Vitter, B Xu
IEEE/ACM transactions on computational biology and bioinformatics 9 (2), 421-429, 2011
Efficient algorithms for the order preserving pattern matching problem
S Faro, MO Külekci
International Conference on Algorithmic Applications in Management, 185-196, 2016
Shortest Unique Substring Query Revisited
BX Atalay Mert İleri, M. Oğuzhan Külekci
Combinatorial Pattern Matching, Lecture Notes in Computer Science 8486, 172-181, 2014
Alternative Algorithms for Order-Preserving Matching.
T Chhabra, MO Külekci, J Tarhio
Stringology, 36-46, 2015
A method to overcome computer word size limitation in bit-parallel pattern matching
MO Külekci
International Symposium on Algorithms and Computation, 496-506, 2008
Enhanced variable-length codes: Improved compression with efficient random access
MO Külekci
2014 Data Compression Conference, 362-371, 2014
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem.
D Cantone, S Faro, MO Külekci
Stringology, 22-35, 2015
BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
MO Külekci
Mathematics in Computer Science 3 (4), 407-420, 2010
Tara: An algorithm for fast searching of multiple patterns on text files
MO Kulekci
2007 22nd international symposium on computer and information sciences, 1-6, 2007
Engineering order‐preserving pattern matching with SIMD parallelism
T Chhabra, S Faro, MO Külekci, J Tarhio
Software: Practice and Experience 47 (5), 731-739, 2017
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
AM Ileri, MO Külekci, B Xu
Theoretical Computer Science 562, 621-633, 2015
Fast and flexible packed string matching
S Faro, MO Külekci
Journal of Discrete Algorithms 28, 61-72, 2014
Sketching algorithms for genomic data analysis and querying in a secure enclave
C Kockan, K Zhu, N Dokmai, N Karpov, MO Kulekci, DP Woodruff, ...
Nature methods 17 (3), 295-301, 2020
On scrambling the burrows–wheeler transform to provide privacy in lossless compression
MO Külekci
Computers & Security 31 (1), 26-32, 2012
Turkish word segmentation using morphological analyzer
MO Külekcý, M Özkan
Seventh European Conference on Speech Communication and Technology, 2001
Nucleotide sequence alignment and compression via shortest unique substring
B Adaş, E Bayraktar, S Faro, IE Moustafa, MO Külekci
International Conference on Bioinformatics and Biomedical Engineering, 363-374, 2015
Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees
MO Külekci
2013 IEEE International Symposium on Information Theory, 1969-1973, 2013
The system can't perform the operation now. Try again later.
Articles 1–20