Djamal Belazzougui

From MaRDI portal
Person:248933

Available identifiers

zbMath Open belazzougui.djamalMaRDI QIDQ248933

List of research outcomes





PublicationDate of PublicationType
Random input helps searching predecessors2024-10-31Paper
Efficient reconciliation of genomic datasets of high similarity2024-08-13Paper
Genome-Scale Algorithm Design2023-08-29Paper
Space-Efficient Representation of Genomic k-Mer Count Tables2023-07-24Paper
https://portal.mardi4nfdi.de/entity/Q60987782023-06-14Paper
https://portal.mardi4nfdi.de/entity/Q58744292023-02-07Paper
Smaller Fully-Functional Bidirectional BWT Indexes2022-12-22Paper
https://portal.mardi4nfdi.de/entity/Q50888982022-07-18Paper
Computing the Antiperiod(s) of a String2022-07-18Paper
Range majorities and minorities in arrays2021-06-11Paper
Linear-time string indexing and analysis in small space2021-05-03Paper
Fast label extraction in the CDAWG2021-02-16Paper
Block trees2021-02-02Paper
Fast matching statistics in small space2020-12-16Paper
Representing the suffix tree with the CDAWG2020-05-25Paper
Theory and practice of monotone minimal perfect hashing2019-09-11Paper
Bidirectional Variable-Order de Bruijn Graphs2019-06-24Paper
Compressed static functions with applications2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338912019-05-06Paper
Alphabet-independent compressed text indexing2018-10-30Paper
Optimal lower and upper bounds for representing sequences2018-10-30Paper
Fully dynamic de Bruijn graphs2018-10-17Paper
Indexing and querying character sets in one- and two-dimensional words2018-10-11Paper
Range predecessor and Lempel-Ziv parsing2018-07-16Paper
A framework for space-efficient string kernels2017-11-09Paper
Flexible indexing of repetitive collections2017-08-04Paper
Indexing and querying color sets of images2016-09-01Paper
Bidirectional variable-order de Bruijn graphs2016-05-03Paper
Compressed string dictionary search with edit distance one2016-04-06Paper
Optimal Las Vegas reduction from one-way set reconciliation to error correction2016-02-26Paper
Access, rank, and select in grammar-compressed strings2015-11-19Paper
Improved space-time tradeoffs for approximate full-text indexing with one edit error2015-09-02Paper
A framework for space-efficient string kernels2015-08-20Paper
Composite repetition-aware data structures2015-08-20Paper
Linear time construction of compressed text indices in compact space2015-06-26Paper
Simple, compact and robust approximate string dictionary2014-09-05Paper
Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)2014-09-02Paper
Various improvements to text fingerprinting2014-08-13Paper
Theory and practice of monotone minimal perfect hashing2014-04-01Paper
Single and multiple consecutive permutation motif search2014-01-14Paper
Versatile succinct representations of the bidirectional Burrows-Wheeler transform2013-09-17Paper
Better space bounds for parameterized range majority and minority2013-08-12Paper
Improved compressed indexes for full-text document retrieval2013-06-24Paper
Approximate regular expression matching with multi-strings2013-06-24Paper
Average optimal string matching in packed strings2013-06-07Paper
New lower and upper bounds for representing sequences2012-09-25Paper
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model2012-09-13Paper
Compressed string dictionary look-up with edit distance one2012-08-14Paper
Alphabet-independent compressed text indexing2011-09-16Paper
Worst case efficient single and multiple string matching in the RAM model2011-05-19Paper
Fast prefix search in little space, with applications2010-09-06Paper
Succinct Dictionary Matching with No Slowdown2010-07-26Paper
Hash, Displace, and Compress2009-10-29Paper
Faster and Space-Optimal Edit Distance “1” Dictionary2009-07-07Paper

Research outcomes over time

This page was built for person: Djamal Belazzougui