scientific article; zbMATH DE number 7559039
From MaRDI portal
Publication:5090361
DOI10.4230/LIPIcs.WABI.2018.21zbMath1494.92082MaRDI QIDQ5090361
Mai Alzamel, Giovanna Rosone, Costas S. Iliopoulos, Giulia Bernardini, Lorraine A. K. Ayad, Roberto Grossi, Nadia Pisanti, Solon P. Pissis
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
palindromesstring comparisondegenerate stringselastic-degenerate stringsgeneralised degenerate strings
Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Related Items (8)
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ On the Complexity of String Matching for Graphs ⋮ Elastic-degenerate string matching with 1 error ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Unnamed Item ⋮ Approximate pattern matching on elastic-degenerate text ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Comparing Degenerate Strings
Cites Work
- A subquadratic algorithm for minimum palindromic factorization
- Which problems have strongly exponential complexity?
- Covering problems for partial words and for indeterminate strings
- Efficient pattern matching in elastic-degenerate strings
- 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
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
- On the complexity of \(k\)-SAT
This page was built for publication:
