scientific article; zbMATH DE number 7559178
From MaRDI portal
Publication:5088898
DOI10.4230/LIPIcs.CPM.2019.10MaRDI QIDQ5088898
Djamal Belazzougui, Fabio Cunial
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.10165
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Algorithms and complexity on indexing founder graphs ⋮ Space efficient merging of de Bruijn graphs and Wheeler graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-pattern matching with bidirectional indexes
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics
- The level ancestor problem simplified
- Finding level-ancestors in trees
- On maximal repeats in strings
- Approximate string matching with compressed indexes
- A framework for space-efficient string kernels
- Succinct 2D dictionary matching
- The affix array data structure and its applications to RNA secondary structure analysis
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Bidirectional Variable-Order de Bruijn Graphs
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
- Composite Repetition-Aware Data Structures
- Dynamic text and static pattern matching
- Pattern Discovery in RNA Secondary Structure Using Affix Trees
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Linear-time String Indexing and Analysis in Small Space
- Fast matching statistics in small space
- Fast Label Extraction in the CDAWG
- Complete inverted files for efficient text retrieval and analysis
- Linear time construction of compressed text indices in compact space
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Combinatorial Pattern Matching
This page was built for publication:
