Maximal degenerate palindromes with gaps and mismatches

DOI10.1016/j.tcs.2023.114182MaRDI QIDQ6073887

Dimitrios Vlachakis, Zara Lim, Mai Alzamel, Solon P. Pissis, Costas S. Iliopoulos, Steven Watts, Christopher Hampson

Publication date: 12 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

mismatchstring factorisationinverted repeatdegenerate palindrome

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subquadratic algorithm for minimum palindromic factorization
• Parallel detection of all palindromes in a string
• Searching for gapped palindromes
• Efficient string matching with k mismatches
• 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
• Finding Gapped Palindromes Online
• Palindromes in SARS and Other Coronaviruses
• Generalized String Matching
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• Algorithms on Strings, Trees and Sequences
• On-line pattern matching on similar texts
• Pattern Matching on Elastic-Degenerate Text with Errors
• Computing Palindromic Factorizations and Palindromic Covers On-line
• Pal k is Linear Recognizable Online
• Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
• Palindromic Decompositions with Gaps and Errors