User profiles for M. Oguzhan Kulekci
 | M. Oguzhan KülekciDept. of Computer Science, Indiana University Bloomington and Istanbul Technical … Verified email at acm.org Cited by 612 |
Sketching algorithms for genomic data analysis and querying in a secure enclave
Genome-wide association studies (GWAS), especially on rare diseases, may necessitate
exchange of sensitive genomic data between multiple institutions. Since genomic data sharing …
exchange of sensitive genomic data between multiple institutions. Since genomic data sharing …
Fast packed string matching for short patterns
S Faro, MO Külekci - 2013 Proceedings of the Fifteenth Workshop on …, 2013 - SIAM
Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …
science with applications in many other fields, like natural language processing, information …
[PDF][PDF] Filter Based Fast Matching of Long Patterns by Using SIMD Instructions.
MO Külekci - Stringology, 2009 - psc.fit.cvut.cz
SIMD instructions exist in many recent microprocessors supporting parallel execution of
some operations on multiple data simultaneously via a set of special instructions working on …
some operations on multiple data simultaneously via a set of special instructions working on …
Fast multiple string matching using streaming SIMD extensions technology
S Faro, MO Külekci - International symposium on string processing and …, 2012 - Springer
Searching for all occurrences of a given set of patterns in a text is a fundamental problem in
computer science with applications in many fields, like computational biology and intrusion …
computer science with applications in many fields, like computational biology and intrusion …
Shortest unique substring query revisited
We revisit the problem of finding shortest unique substring (SUS) proposed recently by Pei
et al. (ICDE’13). We propose an optimal O(n) time and space algorithm that can find an SUS …
et al. (ICDE’13). We propose an optimal O(n) time and space algorithm that can find an SUS …
[PDF][PDF] Alternative Algorithms for Order-Preserving Matching.
The problem of order-preserving matching is to find all substrings in the text which have the
same relative order and length as the pattern. Several online and one offline solution were …
same relative order and length as the pattern. Several online and one offline solution were …
Efficient algorithms for the order preserving pattern matching problem
S Faro, MO Külekci - Algorithmic Aspects in Information and Management …, 2016 - Springer
Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the
order-preserving pattern matching problem consists in finding all substrings of the text with the …
order-preserving pattern matching problem consists in finding all substrings of the text with the …
[HTML][HTML] Fast and flexible packed string matching
S Faro, MO Külekci - Journal of Discrete Algorithms, 2014 - Elsevier
Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …
science with applications in many other fields, like natural language processing, information …
Efficient maximal repeat finding using the burrows-wheeler transform and wavelet tree
Finding repetitive structures in genomes and proteins is important to understand their
biological functions. Many data compressors for modern genomic sequences rely heavily on …
biological functions. Many data compressors for modern genomic sequences rely heavily on …
Engineering order‐preserving pattern matching with SIMD parallelism
The order‐preserving pattern matching problem has gained attention in recent years. It consists
in finding all substrings in the text, which have the same length and relative order as the …
in finding all substrings in the text, which have the same length and relative order as the …