M. Oguzhan Külekci

Orcid: 0000-0002-4583-6261

According to our database1, M. Oguzhan Külekci authored at least 59 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An extended de Bruijn graph for feature engineering over biological sequential data.
Mach. Learn. Sci. Technol., 2024

2023
Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Tile Selection-based H.265/HEVC Coding.
Proceedings of the 16th International Conference on Signal-Image Technology & Internet-Based Systems, 2022

Counting with Prediction: Rank and Select Queries with Adjusted Anchoring.
Proceedings of the Data Compression Conference, 2022

Memory-Efficient FM-Index Construction for Reference Genomes.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

2021
I/O-efficient data structures for non-overlapping indexing.
Theor. Comput. Sci., 2021

An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions.
CoRR, 2021

2020
The order-preserving pattern matching problem in practice.
Discret. Appl. Math., 2020

A Survey on Shortest Unique Substring Queries.
Algorithms, 2020

Enumerative Data Compression with Non-Uniquely Decodable Codes.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Shape-Preserving Pattern Matching.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

FM-Index Reveals the Reverse Suffix Array.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation.
Algorithms, 2019

Privacy-Preserving Text Similarity via Non-Prefix-Free Codes.
Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

Sketching Algorithms for Genomic Data Analysis and Querying in a Secure Enclave.
Proceedings of the Research in Computational Molecular Biology, 2019

2018
A Two-Level Scheme for Quality Score Compression.
J. Comput. Biol., 2018

An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Optimizing Packed String Matching on AVX2 Platform.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2018, 2018

Quality Assessment of High-Throughput DNA Sequencing Data via Range Analysis.
Proceedings of the Bioinformatics and Biomedical Engineering, 2018

Non-Overlapping Indexing - Cache Obliviously.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Engineering order-preserving pattern matching with SIMD parallelism.
Softw. Pract. Exp., 2017

Range selection and predecessor queries in data aware space and time.
J. Discrete Algorithms, 2017

A System Architecture for Efficient Transmission of Massive DNA Sequencing Data.
J. Comput. Biol., 2017

Security analysis on the ADS-B technology.
Proceedings of the 25th Signal Processing and Communications Applications Conference, 2017

2016
Inverse Range Selection Queries.
Proceedings of the String Processing and Information Retrieval, 2016

GENCROBAT: Efficient transmission and processing of the massive genomic data.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Efficient Algorithms for the Order Preserving Pattern Matching Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries.
Theor. Comput. Sci., 2015

On Longest Repeat Queries.
CoRR, 2015

Huffman Codes versus Augmented Non-Prefix-Free Codes.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Alternative Algorithms for Order-Preserving Matching.
Proceedings of the Prague Stringology Conference 2015, 2015

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem.
Proceedings of the Prague Stringology Conference 2015, 2015

Nucleotide Sequence Alignment and Compression via Shortest Unique Substring.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

Range Selection Queries in Data Aware Space and Time.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Fast and flexible packed string matching.
J. Discrete Algorithms, 2014

Enhanced Variable-Length Codes: Improved Compression with Efficient Random Access.
Proceedings of the Data Compression Conference, 2014

Shortest Unique Substring Query Revisited.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Fast Packed String Matching for Short Patterns.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012
Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Enumeration of sequences with large alphabets
CoRR, 2012

A memory versus compression ratio trade-off in PPM via compressed context modeling
CoRR, 2012

On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression.
Comput. Secur., 2012

Fast Pattern-Matching via <i>k</i>-bit Filtering Based Text Decomposition.
Comput. J., 2012

Fast Multiple String Matching Using Streaming SIMD Extensions Technology.
Proceedings of the String Processing and Information Retrieval, 2012

On enumerating the DNA sequences.
Proceedings of the ACM International Conference on Bioinformatics, 2012

2011
Compressed Context Modeling for Text Compression.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

A Method to Ensure the Confidentiality of the Compressed Data.
Proceedings of the First International Conference on Data Compression, 2011

2010
BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation.
Math. Comput. Sci., 2010

Boosting Pattern Matching Performance via <i>k</i>-bit Filtering.
Proceedings of the Computer and Information Sciences, 2010

PSI-RA: A parallel sparse index for read alignment on genomes.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
An Empirical Analysis of Pattern Scan Order in Pattern Matching.
Proceedings of the World Congress on Engineering, 2007

2006
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ı)
PhD thesis, 2006

2005
Pronunciation Disambiguation in Turkish.
Proceedings of the Computer and Information Sciences, 2005

2001
Turkish word segmentation using morphological analyzer.
Proceedings of the EUROSPEECH 2001 Scandinavia, 2001


  Loading...