scientific article; zbMATH DE number 7765421
From MaRDI portal
Publication:6065473
DOI10.4230/lipics.isaac.2020.63arXiv2007.06604MaRDI QIDQ6065473
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2007.06604
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A four-stage algorithm for updating a Burrows-Wheeler transform
- Parameterized matching with mismatches
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Dynamic extended suffix arrays
- Efficient string matching with k mismatches
- Lyndon words, permutations and trees.
- Improved dynamic dictionary matching
- Parameterized pattern matching: Algorithms and applications
- On-line construction of parameterized suffix trees for large alphabets
- Fast gapped variants for Lempel-Ziv-Welch compression
- Dynamic text and static pattern matching
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Fast parallel and serial approximate string matching
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Fully Dynamic Data Structure for LCE Queries in Compressed Space
- Repetition Detection in a Dynamic String
- Longest Common Factor After One Edit Operation
- Optimal parallel algorithms for periods, palindromes and squares
- Algorithms on Strings
- Algorithms – ESA 2004
- Finding the Position of the k-Mismatch and Approximate Tandem Repeats
This page was built for publication:
