Palindromic Decompositions with Gaps and Errors

DOI10.1142/S0129054118430050zbMath1415.68268WikidataQ128612872 ScholiaQ128612872MaRDI QIDQ5384622

Michał Adamczyk, Panagiotis Charalampopoulos, Mai Alzamel, Jakub Radoszewski

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximationspalindromesHIV viruses

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items

Maximal degenerate palindromes with gaps and mismatches ⋮ Computing longest palindromic substring after single-character or block-wise edits

Uses Software

• EERTREE

Cites Work

• Unnamed Item
• On palindromic factorization of words
• A subquadratic algorithm for minimum palindromic factorization
• Parallel detection of all palindromes in a string
• Searching for gapped palindromes
• Palindromes in the Fibonacci word
• EERTREE: an efficient data structure for processing palindromes in strings
• Finding approximate palindromes in strings
• Finding all periods and initial palindromes of a string in parallel
• Palindromes and Sturmian words
• Palindromic decompositions with gaps and errors
• Finding Gapped Palindromes Online
• FINDING ALL APPROXIMATE GAPPED PALINDROMES
• Finding All Approximate Gapped Palindromes
• 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
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Computing Palindromic Factorizations and Palindromic Covers On-line
• Pal k is Linear Recognizable Online
• Algorithms on Strings

This page was built for publication: Palindromic Decompositions with Gaps and Errors