default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDjamal Belazzougui
Person information
- affiliation: University of Helsinki
SPARQL queries 
🛈 Please note that only 66% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c50]Idir Tiab, Ahror Belaid, Saïd Yahiaoui, Djamal Belazzougui, Nabil Hafsi, Mokrane Iguer-Ouada:
Deep Characterization For Sperm Analysis: Leveraging A Novel Dataset To Enhance Motility Assessments. ATSIP 2024: 200-205- [c49]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better Space-Time-Robustness Trade-Offs for Set Reconciliation. ICALP 2024: 20:1-20:19 - [i37]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better space-time-robustness trade-offs for set reconciliation. CoRR abs/2404.09607 (2024) - 2023
- [b2]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu
:
Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing (2nd edition). Cambridge University Press 2023, ISBN 9781009341233 - [e1]Djamal Belazzougui, Aïda Ouangraoua:
23rd International Workshop on Algorithms in Bioinformatics, WABI 2023, September 4-6, 2023, Houston, TX, USA. LIPIcs 273, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-294-5 [contents] - 2022
- [j23]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Space-efficient representation of genomic k-mer count tables. Algorithms Mol. Biol. 17(1): 5 (2022) - [j22]Fabio Cunial, Olgert Denas, Djamal Belazzougui:
Fast and compact matching statistics analytics. Bioinform. 38(7): 1838-1845 (2022) - [j21]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to k-Mer Annotation. J. Comput. Biol. 29(2): 140-154 (2022) - [c48]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Efficient Reconciliation of Genomic Datasets of High Similarity. WABI 2022: 14:1-14:14 - 2021
- [j20]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. Algorithmica 83(6): 1707-1733 (2021) - [j19]Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Block trees. J. Comput. Syst. Sci. 117: 1-22 (2021) - [c47]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CPM 2021: 8:1-8:15 - [c46]Amel Imene Hadj Bouzid, Saïd Yahiaoui, Anis Lounis, Sid-Ahmed Berrani, Hacène Belbachir, Qaïs Naïli, Mohamed El Hafedh Abdi, Kawthar Bensalah, Djamal Belazzougui:
DIAG a Diagnostic Web Application Based on Lung CT Scan Images and Deep Learning. MIE 2021: 332-336 - [c45]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Space-Efficient Representation of Genomic k-Mer Count Tables. WABI 2021: 8:1-8:19 - [i36]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CoRR abs/2103.00462 (2021) - 2020
- [j18]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time String Indexing and Analysis in Small Space. ACM Trans. Algorithms 16(2): 17:1-17:54 (2020) - [c44]Djamal Belazzougui, Gregory Kucherov:
Efficient Tree-Structured Categorical Retrieval. CPM 2020: 4:1-4:11 - [c43]Djamal Belazzougui, Fabio Cunial:
Smaller Fully-Functional Bidirectional BWT Indexes. SPIRE 2020: 42-59 - [i35]Djamal Belazzougui, Gregory Kucherov:
Efficient tree-structured categorical retrieval. CoRR abs/2006.01825 (2020)
2010 – 2019
- 2019
- [j17]Fabio Cunial, Jarno Alanko, Djamal Belazzougui:
A framework for space-efficient variable-order Markov models. Bioinform. 35(22): 4607-4616 (2019) - [c42]Djamal Belazzougui, Fabio Cunial:
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs. CPM 2019: 10:1-10:15 - [c41]Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi:
Computing the Antiperiod(s) of a String. CPM 2019: 32:1-32:11 - [i34]Fabio Cunial, Djamal Belazzougui:
Fully-functional bidirectional Burrows-Wheeler indexes. CoRR abs/1901.10165 (2019) - 2018
- [j16]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. Int. J. Found. Comput. Sci. 29(8): 1279-1295 (2018) - [j15]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing. IEEE/ACM Trans. Netw. 26(3): 1151-1164 (2018) - [c40]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. GASCom 2018: 106-115 - [c39]Djamal Belazzougui, Fabio Cunial, Olgert Denas:
Fast matching statistics in small space. SEA 2018: 17:1-17:14 - [i33]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Fast Prefix Search in Little Space, with Applications. CoRR abs/1804.04720 (2018) - [i32]Diego Díaz-Domínguez, Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Gonzalo Navarro, Simon J. Puglisi:
Assembling Omnitigs using Hidden-Order de Bruijn Graphs. CoRR abs/1805.05228 (2018) - 2017
- [j14]Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. Algorithmica 79(3): 857-883 (2017) - [j13]Jarno Alanko, Fabio Cunial, Djamal Belazzougui, Veli Mäkinen:
A framework for space-efficient read clustering in metagenomic samples. BMC Bioinform. 18(S-3): 49-60 (2017) - [c38]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Flexible Indexing of Repetitive Collections. CiE 2017: 162-174 - [c37]Djamal Belazzougui, Fabio Cunial:
Representing the Suffix Tree with the CDAWG. CPM 2017: 7:1-7:13 - [c36]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A concise forwarding information base for scalable and fast name lookups. ICNP 2017: 1-10 - [c35]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A Fast, Small, and Dynamic Forwarding Information Base. SIGMETRICS (Abstracts) 2017: 41-42 - [c34]Djamal Belazzougui, Fabio Cunial:
Fast Label Extraction in the CDAWG. SPIRE 2017: 161-175 - [i31]Djamal Belazzougui, Fabio Cunial:
Representing the suffix tree with the CDAWG. CoRR abs/1705.08640 (2017) - [i30]Djamal Belazzougui, Fabio Cunial:
Fast Label Extraction in the CDAWG. CoRR abs/1707.08197 (2017) - 2016
- [j12]Djamal Belazzougui, Rossano Venturini:
Compressed String Dictionary Search with Edit Distance One. Algorithmica 74(3): 1099-1122 (2016) - [j11]Djamal Belazzougui:
Optimal Las Vegas reduction from one-way set reconciliation to error correction. Theor. Comput. Sci. 621: 14-21 (2016) - [j10]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Indexing and querying color sets of images. Theor. Comput. Sci. 647: 74-84 (2016) - [c33]Djamal Belazzougui, Qin Zhang:
Edit Distance: Sketching, Streaming, and Document Exchange. FOCS 2016: 51-60 - [c32]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. LATIN 2016: 164-178 - [c31]Djamal Belazzougui, Simon J. Puglisi:
Range Predecessor and Lempel-Ziv Parsing. SODA 2016: 2053-2071 - [c30]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. SPIRE 2016: 145-152 - [c29]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. SEA 2016: 63-74 - [r2]Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela:
Compressed Suffix Array. Encyclopedia of Algorithms 2016: 386-390 - [r1]Djamal Belazzougui:
Predecessor Search, String Algorithms and Data Structures. Encyclopedia of Algorithms 2016: 1605-1611 - [i29]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. CoRR abs/1602.00329 (2016) - [i28]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Practical combinations of repetition-aware data structures. CoRR abs/1604.06002 (2016) - [i27]Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Range Majorities and Minorities in Arrays. CoRR abs/1606.04495 (2016) - [i26]Djamal Belazzougui, Qin Zhang:
Edit Distance: Sketching, Streaming and Document Exchange. CoRR abs/1607.04200 (2016) - [i25]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. CoRR abs/1607.04909 (2016) - [i24]Ye Yu, Djamal Belazzougui, Chen Qian, Qin Zhang:
A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching. CoRR abs/1608.05699 (2016) - [i23]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Indexing and querying color sets of images. CoRR abs/1608.07847 (2016) - [i22]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time string indexing and analysis in small space. CoRR abs/1609.06378 (2016) - 2015
- [b1]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu:
Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing. Cambridge University Press 2015, ISBN 9781107078536 - [j9]Djamal Belazzougui:
Improved Space-Time Tradeoffs for Approximate Full-Text Indexing with One Edit Error. Algorithmica 72(3): 791-817 (2015) - [j8]Djamal Belazzougui, Gonzalo Navarro:
Optimal Lower and Upper Bounds for Representing Sequences. ACM Trans. Algorithms 11(4): 31:1-31:21 (2015) - [c28]Djamal Belazzougui, Fabio Cunial:
A Framework for Space-Efficient String Kernels. CPM 2015: 13-25 - [c27]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite Repetition-Aware Data Structures. CPM 2015: 26-39 - [c26]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. DCC 2015: 83-92 - [c25]Djamal Belazzougui, Patrick Hagge Cording, Simon J. Puglisi, Yasuo Tabei:
Access, Rank, and Select in Grammar-compressed Strings. ESA 2015: 142-154 - [c24]Djamal Belazzougui, Fabio Cunial:
Space-Efficient Detection of Unusual Words. SPIRE 2015: 222-233 - [i21]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite repetition-aware data structures. CoRR abs/1502.05937 (2015) - [i20]Djamal Belazzougui, Fabio Cunial:
A framework for space-efficient string kernels. CoRR abs/1502.06370 (2015) - [i19]Djamal Belazzougui, Simon J. Puglisi:
Range Predecessor and Lempel-Ziv Parsing. CoRR abs/1507.07080 (2015) - [i18]Djamal Belazzougui, Fabio Cunial:
Space-efficient detection of unusual words. CoRR abs/1508.02968 (2015) - [i17]Djamal Belazzougui:
Efficient Deterministic Single Round Document Exchange for Edit Distance. CoRR abs/1511.09229 (2015) - [i16]Djamal Belazzougui:
Optimal Las Vegas reduction from one-way set reconciliation to error correction. CoRR abs/1512.05028 (2015) - 2014
- [j7]Ibrahim Chegrane, Djamal Belazzougui:
Simple, compact and robust approximate string dictionary. J. Discrete Algorithms 28: 49-60 (2014) - [j6]Djamal Belazzougui, Gonzalo Navarro:
Alphabet-Independent Compressed Text Indexing. ACM Trans. Algorithms 10(4): 23:1-23:19 (2014) - [c23]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. DCC 2014: 352-361 - [c22]Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén:
Relative FM-Indexes. SPIRE 2014: 52-64 - [c21]Djamal Belazzougui, Fabio Cunial:
Indexed Matching Statistics and Shortest Unique Substrings. SPIRE 2014: 179-190 - [c20]Djamal Belazzougui:
Linear time construction of compressed text indices in compact space. STOC 2014: 148-193 - [c19]Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen:
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn). SWAT 2014: 26-37 - [i15]Djamal Belazzougui:
Linear time construction of compressed text indices in compact space. CoRR abs/1401.0936 (2014) - [i14]Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei:
Rank, select and access in grammar-compressed strings. CoRR abs/1408.3093 (2014) - [i13]Djamal Belazzougui:
Faster construction of asymptotically good unit-cost error correcting codes in the RAM model. CoRR abs/1408.5518 (2014) - [i12]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. CoRR abs/1412.0967 (2014) - 2013
- [j5]Djamal Belazzougui, Gonzalo Navarro, Daniel Valenzuela:
Improved compressed indexes for full-text document retrieval. J. Discrete Algorithms 18: 3-13 (2013) - [j4]Djamal Belazzougui, Mathieu Raffinot:
Approximate regular expression matching with multi-strings. J. Discrete Algorithms 18: 14-21 (2013) - [j3]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Various improvements to text fingerprinting. J. Discrete Algorithms 22: 1-18 (2013) - [c18]Djamal Belazzougui, Mathieu Raffinot:
Average Optimal String Matching in Packed Strings. CIAC 2013: 37-48 - [c17]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. ESA 2013: 133-144 - [c16]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and Multiple Consecutive Permutation Motif Search. ISAAC 2013: 66-77 - [c15]Djamal Belazzougui, Rossano Venturini:
Compressed static functions with applications. SODA 2013: 229-240 - [c14]Djamal Belazzougui, Travis Gagie, Gonzalo Navarro:
Better Space Bounds for Parameterized Range Majority and Minority. WADS 2013: 121-132 - [i11]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Various improvements to text fingerprinting. CoRR abs/1301.3488 (2013) - [i10]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013) - [i9]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. CoRR abs/1312.0526 (2013) - [i8]Ibrahim Chegrane, Djamal Belazzougui:
Simple, compact and robust approximate string dictionary. CoRR abs/1312.4678 (2013) - 2012
- [j2]Djamal Belazzougui:
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model. J. Discrete Algorithms 14: 91-106 (2012) - [c13]Djamal Belazzougui, Rossano Venturini:
Compressed String Dictionary Look-Up with Edit Distance One. CPM 2012: 280-292 - [c12]Djamal Belazzougui, Gonzalo Navarro:
New Lower and Upper Bounds for Representing Sequences. ESA 2012: 181-192 - [i7]Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna:
Predecessor search with distance-sensitive query time. CoRR abs/1209.5441 (2012) - [i6]Djamal Belazzougui, Travis Gagie, Gonzalo Navarro:
Better Space Bounds for Parameterized Range Majority and Minority. CoRR abs/1210.1765 (2012) - 2011
- [j1]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithmics 16 (2011) - [c11]Djamal Belazzougui, Gonzalo Navarro:
Alphabet-Independent Compressed Text Indexing. ESA 2011: 748-759 - [c10]Djamal Belazzougui, Mathieu Raffinot:
Approximate Regular Expression Matching with Multi-strings. SPIRE 2011: 55-66 - [c9]Djamal Belazzougui, Gonzalo Navarro:
Improved Compressed Indexes for Full-Text Document Retrieval. SPIRE 2011: 386-397 - [i5]Djamal Belazzougui:
Improved space-time tradeoffs for approximate full-text indexing with one edit error. CoRR abs/1103.2167 (2011) - [i4]Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis:
Random input helps searching predecessors. CoRR abs/1104.4353 (2011) - [i3]Djamal Belazzougui, Gonzalo Navarro:
New Lower and Upper Bounds for Representing Sequences. CoRR abs/1111.2621 (2011) - 2010
- [c8]Djamal Belazzougui:
Succinct Dictionary Matching with No Slowdown. CPM 2010: 88-100 - [c7]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Fast Prefix Search in Little Space, with Applications. ESA (1) 2010: 427-438 - [c6]Djamal Belazzougui:
Worst Case Efficient Single and Multiple String Matching in the RAM Model. IWOCA 2010: 90-102 - [c5]Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna:
Dynamic Z-Fast Tries. SPIRE 2010: 159-172 - [i2]Djamal Belazzougui:
Succinct Dictionary Matching With No Slowdown. CoRR abs/1001.2860 (2010) - [i1]Djamal Belazzougui:
Worst case efficient single and multiple string matching in the Word-RAM model. CoRR abs/1011.3441 (2010)
2000 – 2009
- 2009
- [c4]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144 - [c3]Djamal Belazzougui:
Faster and Space-Optimal Edit Distance "1" Dictionary. CPM 2009: 154-167 - [c2]Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger:
Hash, Displace, and Compress. ESA 2009: 682-693 - [c1]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794
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-09-07 00:58 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:
