Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Oguzhan Külekci
Person information
- unicode name: M. Oğuzhan Külekci
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c39]M. Oguzhan Külekci
:
Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation. COCOON (1) 2023: 310-323- 2022
- [c38]Arghya Kusum Das, M. Oguzhan Külekci, Sharma V. Thankachan:
Memory-Efficient FM-Index Construction for Reference Genomes. BIBM 2022: 736-739 - [c37]M. Oguzhan Külekci:
Counting with Prediction: Rank and Select Queries with Adjusted Anchoring. DCC 2022: 409-418 - [c36]Hakki Burak Çardak, Levent Çarkacioglu, Muhammed Oguzhan Külekci:
Tile Selection-based H.265/HEVC Coding. SITIS 2022: 545-552 - 2021
- [j14]Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
I/O-efficient data structures for non-overlapping indexing. Theor. Comput. Sci. 857: 1-7 (2021) - [i8]Gözde Filiz, M. Oguzhan Külekci:
An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions. CoRR abs/2105.10689 (2021) - 2020
- [j13]Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
A Survey on Shortest Unique Substring Queries. Algorithms 13(9): 224 (2020) - [j12]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
The order-preserving pattern matching problem in practice. Discret. Appl. Math. 274: 11-25 (2020) - [c35]Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan:
FM-Index Reveals the Reverse Suffix Array. CPM 2020: 13:1-13:14 - [c34]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
Shape-Preserving Pattern Matching. ICTCS 2020: 137-148 - [c33]M. Oguzhan Külekci, Yasin Öztürk, Elif Altunok, Can Yilmaz Altinigne:
Enumerative Data Compression with Non-Uniquely Decodable Codes. Stringology 2020: 23-32
2010 – 2019
- 2019
- [j11]Muhammed Oguzhan Külekci, Yasin Öztürk:
Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation. Algorithms 12(4): 78 (2019) - [c32]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: 302-304 - [c31]M. Oguzhan Külekci, Ismail Habib, Amir Aghabaiglou:
Privacy-Preserving Text Similarity via Non-Prefix-Free Codes. SISAP 2019: 94-102 - [i7]M. Oguzhan Külekci, Yasin Öztürk, Elif Altunok, Can Yilmaz Altinigne:
Enumerative Data Compression with Non-Uniquely Decodable Codes. CoRR abs/1911.05676 (2019) - 2018
- [j10]Jan Voges, Ali Fotouhi, Jörn Ostermann, Muhammed Oguzhan Külekci:
A Two-Level Scheme for Quality Score Compression. J. Comput. Biol. 25(10): 1141-1151 (2018) - [c30]Sahar Hooshmand, Paniz Abedin, M. Oguzhan Külekci, Sharma V. Thankachan:
Non-Overlapping Indexing - Cache Obliviously. CPM 2018: 8:1-8:9 - [c29]Ali Fotouhi, Mina Majidi, M. Oguzhan Külekci:
Quality Assessment of High-Throughput DNA Sequencing Data via Range Analysis. IWBBIO (1) 2018: 429-438 - [c28]Mehmet Akif Aydogmus, M. Oguzhan Külekci:
Optimizing Packed String Matching on AVX2 Platform. VECPAR 2018: 45-61 - [c27]M. Oguzhan Külekci:
An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes. SEA 2018: 7:1-7:13 - 2017
- [j9]Mahmut Samil Sagiroglu, M. Oguzhan Külekci:
A System Architecture for Efficient Transmission of Massive DNA Sequencing Data. J. Comput. Biol. 24(11): 1081-1088 (2017) - [j8]M. Oguzhan Külekci, Sharma V. Thankachan:
Range selection and predecessor queries in data aware space and time. J. Discrete Algorithms 43: 18-25 (2017) - [j7]Tamanna Chhabra, Simone Faro, M. Oguzhan Külekci, Jorma Tarhio:
Engineering order-preserving pattern matching with SIMD parallelism. Softw. Pract. Exp. 47(5): 731-739 (2017) - [c26]Eren Kocaaga, M. Oguzhan Külekci:
Security analysis on the ADS-B technology. SIU 2017: 1-4 - 2016
- [c25]Simone Faro, M. Oguzhan Külekci:
Efficient Algorithms for the Order Preserving Pattern Matching Problem. AAIM 2016: 185-196 - [c24]M. Oguzhan Külekci, Mahmut Samil Sagiroglu:
GENCROBAT: Efficient transmission and processing of the massive genomic data. NOMS 2016: 999-1000 - [c23]M. Oguzhan Külekci:
Inverse Range Selection Queries. SPIRE 2016: 166-177 - 2015
- [j6]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: 621-633 (2015) - [c22]M. Oguzhan Külekci, Sharma V. Thankachan:
Range Selection Queries in Data Aware Space and Time. DCC 2015: 73-82 - [c21]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: 363-374 - [c20]Domenico Cantone, Simone Faro, M. Oguzhan Külekci:
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. Stringology 2015: 22-35 - [c19]Tamanna Chhabra, M. Oguzhan Külekci, Jorma Tarhio:
Alternative Algorithms for Order-Preserving Matching. Stringology 2015: 36-46 - [c18]Boran Adas, Ersin Bayraktar, M. Oguzhan Külekci:
Huffman Codes versus Augmented Non-Prefix-Free Codes. SEA 2015: 315-326 - [i6]Simone Faro, M. Oguzhan Külekci:
Efficient Algorithms for the Order Preserving Pattern Matching Problem. CoRR abs/1501.04001 (2015) - [i5]Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu:
On Longest Repeat Queries. CoRR abs/1501.06259 (2015) - 2014
- [j5]Simone Faro, M. Oguzhan Külekci:
Fast and flexible packed string matching. J. Discrete Algorithms 28: 61-72 (2014) - [c17]Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu:
Shortest Unique Substring Query Revisited. CPM 2014: 172-181 - [c16]M. Oguzhan Külekci:
Enhanced Variable-Length Codes: Improved Compression with Efficient Random Access. DCC 2014: 362-371 - 2013
- [c15]Simone Faro, M. Oguzhan Külekci:
Fast Packed String Matching for Short Patterns. ALENEX 2013: 113-121 - [c14]M. Oguzhan Külekci:
Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. ISIT 2013: 1969-1973 - [c13]Simone Faro, M. Oguzhan Külekci:
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns. Stringology 2013: 78-91 - [i4]Atalay Mert Ileri, M. Oguzhan Külekci, Bojian Xu:
Shortest Unique Substring Query Revisited. CoRR abs/1312.2738 (2013) - 2012
- [j4]M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu:
Fast Pattern-Matching via k-bit Filtering Based Text Decomposition. Comput. J. 55(1): 62-68 (2012) - [j3]M. Oguzhan Külekci:
On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression. Comput. Secur. 31(1): 26-32 (2012) - [j2]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): 421-429 (2012) - [c12]M. Oguzhan Külekci:
On enumerating the DNA sequences. BCB 2012: 442-449 - [c11]Simone Faro, M. Oguzhan Külekci:
Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE 2012: 217-228 - [i3]Simone Faro, M. Oguzhan Külekci:
Fast Packed String Matching for Short Patterns. CoRR abs/1209.6449 (2012) - [i2]M. Oguzhan Külekci:
A memory versus compression ratio trade-off in PPM via compressed context modeling. CoRR abs/1211.2636 (2012) - [i1]M. Oguzhan Külekci:
Enumeration of sequences with large alphabets. CoRR abs/1211.2926 (2012) - 2011
- [c10]M. Oguzhan Külekci:
A Method to Ensure the Confidentiality of the Compressed Data. CCP 2011: 203-209 - [c9]M. Oguzhan Külekci:
Compressed Context Modeling for Text Compression. DCC 2011: 373-382 - 2010
- [j1]M. Oguzhan Külekci:
BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation. Math. Comput. Sci. 3(4): 407-420 (2010) - [c8]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: 622-625 - [c7]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: 663-668 - [c6]M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu:
Boosting Pattern Matching Performance via k-bit Filtering. ISCIS 2010: 27-32
2000 – 2009
- 2009
- [c5]M. Oguzhan Külekci:
Filter Based Fast Matching of Long Patterns by Using SIMD Instructions. Stringology 2009: 118-128 - 2008
- [c4]M. Oguzhan Külekci:
A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching. ISAAC 2008: 496-506 - 2007
- [c3]M. Oguzhan Külekci:
An Empirical Analysis of Pattern Scan Order in Pattern Matching. World Congress on Engineering 2007: 337-341 - 2006
- [b1]Muhammed Oguzhan Külekci:
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ı). Sabancı University, Turkey, 2006 - 2005
- [c2]M. Oguzhan Külekci, Kemal Oflazer:
Pronunciation Disambiguation in Turkish. ISCIS 2005: 636-645 - 2001
- [c1]M. Oguzhan Külekci, Mehmed Özkan:
Turkish word segmentation using morphological analyzer. INTERSPEECH 2001: 1053-1056
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
