-
1Academic Journal
Subject Terms: compressed data structure, perfect hashing, random graph, pseudoforest, component, Theory of computation → Data compression, Information systems → Point lookups, Theory of computation → Bloom filters and hashing, Mathematics of computing → Random graphs, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; https://publikationen.bibliothek.kit.edu/1000185755; https://publikationen.bibliothek.kit.edu/1000185755/168096604; https://doi.org/10.5445/IR/1000185755
-
2Academic Journal
Authors: Hermann, Stefan, Kirmayer, Sebastian, Lehmann, Hans-Peter, Sanders, Peter, Walzer, Stefan, Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz
Source: ISSN: 1868-8969.
Subject Terms: Compressed Data Structures, Perfect Hashing, Theory of computation → Data compression, Theory of computation → Bloom filters and hashing, Information systems → Point lookups, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000185751; https://publikationen.bibliothek.kit.edu/1000185751/168096849; https://doi.org/10.5445/IR/1000185751
-
3Academic Journal
Authors: Lehmann, Hans-Peter, Sanders, Peter, Walzer, Stefan, Ziegler, Jonatan, Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz
Subject Terms: Random Seed, Encoding, Bernoulli Process, Backtracking, Perfect Hashing, Theory of computation → Randomness, geometry and discrete structures, Theory of computation → Data compression, Theory of computation → Data structures design and analysis, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; https://publikationen.bibliothek.kit.edu/1000185753; https://publikationen.bibliothek.kit.edu/1000185753/168097640; https://doi.org/10.5445/IR/1000185753
-
4
-
5Academic Journal
Authors: Hermann S., Lehmann H. -P., Pibiri G. E., Sanders P., Walzer S.
Contributors: Stefan Hermann and Hans-Peter Lehmann and Giulio Ermanno Pibiri and Peter Sanders and Stefan Walzer
Subject Terms: ddc:004, FOS: Computer and information sciences, Information systems → Point lookups, DATA processing & computer science, Computer Science - Data Structures and Algorithms, GPU, Data Structures and Algorithms (cs.DS), Compressed Data Structures, Minimal Perfect Hashing, Theory of computation → Data compression
File Description: application/pdf
Access URL: http://arxiv.org/abs/2404.18497
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.69
https://publikationen.bibliothek.kit.edu/1000174479
https://doi.org/10.5445/IR/1000174479
https://publikationen.bibliothek.kit.edu/1000174479/154801120
https://hdl.handle.net/10278/5081929
https://doi.org/10.4230/LIPIcs.ESA.2024.69 -
6Conference
Authors: Fuchs, Janosch, Whittington, Philip
Source: Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35 ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov ; 41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov 41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11 - 2024-03-15
Subject Terms: String attractors, Theory of computation → Approximation algorithms analysis, Theory of computation → Data compression, Theory of computation → Problems, reductions and completeness, computational complexity, dictionary compression
Subject Geographic: DE
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-311-9; info:eu-repo/semantics/altIdentifier/wos/WOS:001300393400035
-
7Conference
Authors: Fuchs, Janosch, Whittington, Philip
Contributors: Janosch Fuchs and Philip Whittington
Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, Theory of computation → Problems, reductions and completeness, ddc:004, Computational Complexity (cs.CC), Theory of computation → Data compression, String attractors, dictionary compression, Theory of computation → Approximation algorithms analysis
File Description: application/pdf
-
8Academic Journal
Authors: Köppl, Dominik, Kurpicz, Florian, Meyer, Daniel
Contributors: Dominik Köppl and Florian Kurpicz and Daniel Meyer
Subject Terms: ddc:004, DATA processing & computer science, longest previous factor array, block tree, rank and select, Theory of computation → Pattern matching, Lempel-Ziv compression, Theory of computation → Data compression, compressed data structure
File Description: application/pdf
-
9Academic Journal
Contributors: Paolo Ferragina and Hans-Peter Lehmann and Peter Sanders and Giorgio Vinciguerra
Subject Terms: ddc:004, FOS: Computer and information sciences, compressed data structure, monotone minimal perfect hashing, retrieval, DATA processing & computer science, monotone minimal perfect hashing, Information systems → Point lookups, compressed data structure, retrieval, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Data compression
File Description: application/pdf
Access URL: http://arxiv.org/abs/2304.11012
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.46
https://publikationen.bibliothek.kit.edu/1000162137
https://publikationen.bibliothek.kit.edu/1000162137/151310123
https://doi.org/10.5445/IR/1000162137
https://hdl.handle.net/11382/566775
https://doi.org/10.4230/LIPIcs.ESA.2023.46
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.46 -
10Academic Journal
Source: ISSN: 1868-8969.
Subject Terms: compressed data structure, parallel perfect hashing, bit parallelism, GPU, SIMD, parallel computing, vector instructions, Theory of computation → Data compression, Information systems → Point lookups, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-295-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000162136; https://publikationen.bibliothek.kit.edu/1000162136/151309839; https://doi.org/10.5445/IR/1000162136
-
11Academic Journal
Source: ISSN: 1868-8969.
Subject Terms: compressed data structure, monotone minimal perfect hashing, retrieval, Theory of computation → Data compression, Information systems → Point lookups, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
File Description: application/pdf
Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-295-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000162137; https://publikationen.bibliothek.kit.edu/1000162137/151310123; https://doi.org/10.5445/IR/1000162137
-
12Academic Journal
Authors: Köppl, Dominik, Kurpicz, Florian, Meyer, Daniel
Contributors: Gørtz, Inge Li, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz
Subject Terms: longest previous factor array, block tree, rank and select, Theory of computation → Pattern matching, Lempel-Ziv compression, Theory of computation → Data compression, compressed data structure
-
13Academic Journal
Authors: Schmidt, Sebastian, Alanko, Jarno N.
Contributors: Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Institute of Biotechnology, Sebastian Schmidt and Jarno N. Alanko, Boucher, Christina, Rahmann, Sven
Source: Res Sq
Algorithms Mol Biol
Algorithms for Molecular Biology, Vol 18, Iss 1, Pp 1-21 (2023)
Algorithms for Molecular Biology
22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)Subject Terms: 0301 basic medicine, Spectrum preserving string sets, Computer and information sciences, QH301-705.5, Research, 0206 medical engineering, 02 engineering and technology, QH426-470, Article, Eulerian cycle, 03 medical and health sciences, Theory of computation → Graph algorithms analysis, Suffix tree, Bidirected arc-centric de Bruijn graph, K-mer based methods, Genetics, k-mer based methods, Applied computing → Computational biology, ddc:004, Biology (General), Theory of computation → Data compression, Theory of computation → Data structures design and analysis
File Description: application/pdf
-
14Academic Journal
Contributors: Dominik Bez and Florian Kurpicz and Hans-Peter Lehmann and Peter Sanders, Gørtz, Inge Li, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz
Subject Terms: ddc:004, FOS: Computer and information sciences, parallel computing, DATA processing & computer science, parallel perfect hashing, GPU, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, SIMD, Information systems → Point lookups, vector instructions, Computer Science - Data Structures and Algorithms, bit parallelism, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Theory of computation → Data compression, compressed data structure
File Description: application/pdf
-
15Conference
Authors: Gagie, Travis, Gourdel, Garance, Manzini, Giovanni
Contributors: Dalhousie University Halifax, Scalable, Optimized and Parallel Algorithms for Genomics (GenScale), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), University of Pisa - Università di Pisa
Source: WABI 2021 - Workshop on Algorithms in Bioinformatics ; https://hal.science/hal-03478058 ; WABI 2021 - Workshop on Algorithms in Bioinformatics, Aug 2021, Online conference, France. pp.1-21, ⟨10.4230/LIPIcs.WABI.2021.13⟩
Subject Terms: Theory of computation → Data compression phrases data compression, compact data structures, FM-index, Burrows-Wheeler Transform, EBWT, XBWT, DNA reads, [INFO]Computer Science [cs]
Subject Geographic: Online conference, France
Time: Online conference, France
-
16Academic Journal
Authors: Khan, Shahbaz
Contributors: Gawrychowski, Pawel, Starikovskaya, Tatiana, Department of Computer Science, Shahbaz Khan, Gawrychowski, Paweł
Source: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
Subject Terms: String algorithms, FOS: Computer and information sciences, Genome assembly, Computer and information sciences, Discrete Mathematics (cs.DM), 0206 medical engineering, Hierarchical Overlap Graphs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Theory of computation → Pattern matching, ddc:004, Theory of computation → Data compression, Mathematics of computing → Trees, Computer Science - Discrete Mathematics
File Description: application/pdf
Access URL: http://arxiv.org/abs/2102.02873
https://drops.dagstuhl.de/opus/volltexte/2021/13968/pdf/LIPIcs-CPM-2021-17.pdf/
https://researchportal.helsinki.fi/en/publications/optimal-construction-of-hierarchical-overlap-graphs
https://drops.dagstuhl.de/opus/volltexte/2021/13968/
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-02873
https://helda.helsinki.fi/handle/10138/334910
http://hdl.handle.net/10138/334910
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.17 -
17Conference
Authors: Das, Syamantak, Kumar, Nikhil, Vaz, Daniel
Contributors: Indraprastha Institute of Information Technology New Delhi (IIIT-Delhi), University of Waterloo Waterloo, Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) ; https://hal.science/hal-04714707 ; 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), Aug 2024, Bratislava, Slovakia. ⟨10.4230/LIPIcs.MFCS.2024.45⟩
Subject Terms: Theory of computation → Data compression, Theory of computation → Sparsification and spanners, Theory of computation → Network flows, Theory of computation → Graph algorithms analysis, Bounded Treewidth, Quasi-bipartite Graphs, Flow Sparsifiers, Cut Sparsifiers, Graph Sparsification, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Subject Geographic: Bratislava, Slovakia
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.09433; ARXIV: 2407.09433
-
18Academic Journal
Authors: Gagie T., Gourdel G., Manzini G.
Contributors: Gourdel, Garance, Travis Gagie and Garance Gourdel and Giovanni Manzini
Subject Terms: Genomics (q-bio.GN), FOS: Computer and information sciences, Burrows-wheeler transform, Compact data structures, Data compression, DNA reads, EBWT, FM-index, XBWT, 0206 medical engineering, compact data structures, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Theory of computation → Data compression phrases data compression, 01 natural sciences, FOS: Biological sciences, Computer Science - Data Structures and Algorithms, Quantitative Biology - Genomics, Data Structures and Algorithms (cs.DS), Burrows-Wheeler Transform, ddc:004, data compression
File Description: application/pdf
Access URL: http://arxiv.org/abs/1809.07320
https://hal.science/hal-03478058v1
https://doi.org/10.4230/lipics.wabi.2021.13
https://hal.science/hal-03478058v1/document
https://drops.dagstuhl.de/opus/volltexte/2021/14366/
https://drops.dagstuhl.de/opus/volltexte/2021/14366/pdf/LIPIcs-WABI-2021-13.pdf/
https://dblp.uni-trier.de/db/conf/wabi/wabi2021.html#GagieGM21
https://doi.org/10.4230/LIPIcs.WABI.2021.13
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2021.13
https://hdl.handle.net/11568/1119153
https://doi.org/10.4230/LIPIcs.WABI.2021.13 -
19Academic Journal
Authors: Brown NK; Faculty of Computer Science, Dalhousie University, NS, Canada., Gagie T; Faculty of Computer Science, Dalhousie University, NS, Canada., Rossi M; Department of Computer and Information Science and Engineering, University of Florida, FL, USA.
Source: LIPIcs : Leibniz international proceedings in informatics [Lebniz Int Proc Inform] 2022 Jul; Vol. 233. Date of Electronic Publication: 2022 Jul 11.
Publication Type: Journal Article
Journal Info: Publisher: Schloss Dagstuhl, Leibniz Center for Informatics Country of Publication: Germany NLM ID: 101729999 Publication Model: Print-Electronic Cited Medium: Internet ISSN: 1868-8969 (Electronic) Linking ISSN: 18688969 NLM ISO Abbreviation: Lebniz Int Proc Inform Subsets: PubMed not MEDLINE
-
20Academic Journal
Authors: Kempa D; Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA., Langmead B; Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA.
Source: LIPIcs : Leibniz international proceedings in informatics [Lebniz Int Proc Inform] 2021; Vol. 204.
Publication Type: Journal Article
Journal Info: Publisher: Schloss Dagstuhl, Leibniz Center for Informatics Country of Publication: Germany NLM ID: 101729999 Publication Model: Print Cited Medium: Internet ISSN: 1868-8969 (Electronic) Linking ISSN: 18688969 NLM ISO Abbreviation: Lebniz Int Proc Inform Subsets: PubMed not MEDLINE