Comparing Degenerate Strings
From MaRDI portal
Publication:4988951
DOI10.3233/FI-2020-1947zbMath1497.68587OpenAlexW3091142854MaRDI QIDQ4988951
Giulia Bernardini, Costas S. Iliopoulos, Lorraine A. K. Ayad, Mai Alzamel, Roberto Grossi, Nadia Pisanti, Giovanna Rosone, Solon P. Pissis
Publication date: 20 May 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2020-1947
palindromesstring comparisondegenerate stringselastic-degenerate stringsgeneralized degenerate strings
Related Items (4)
Algorithms and complexity on indexing founder graphs ⋮ Elastic-degenerate string matching with 1 error ⋮ Elastic founder graphs improved and enhanced ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A subquadratic algorithm for minimum palindromic factorization
- Parallel detection of all palindromes in a string
- Which problems have strongly exponential complexity?
- Covering problems for partial words and for indeterminate strings
- EERTREE: an efficient data structure for processing palindromes in strings
- Efficient pattern matching in elastic-degenerate strings
- Approximate pattern matching on elastic-degenerate text
- Palindromic decompositions with gaps and errors
- Generalized String Matching
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Algorithms on Strings, Trees and Sequences
- On-line pattern matching on similar texts
- Palindromic length in linear time
- Faster Online Elastic Degenerate String Matching
- Computing Palindromic Factorizations and Palindromic Covers On-line
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
- Combinatorial Pattern Matching
- On the complexity of \(k\)-SAT
This page was built for publication: Comparing Degenerate Strings
