scientific article; zbMATH DE number 7696009

DOI10.4230/LIPICS.CPM.2021.23MaRDI QIDQ6098796

Author name not available (Why is that?)

Publication date: 14 June 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

pattern matchingsuffix treegapped palindromes

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Efficient Computation of Palindromes in Sequences with Uncertainties* ⋮ FINDING ALL APPROXIMATE GAPPED PALINDROMES

Recommendations

• Title not available (Why is that?) 👍 👎
• Counting distinct palindromes in a word in linear time 👍 👎
• Efficient computation of longest single-arm-gapped palindromes in a string 👍 👎
• An efficient algorithm for the longest common palindromic subsequence problem 👍 👎
• Computing Longest Single-arm-gapped Palindromes in a String 👍 👎
• FINDING ALL APPROXIMATE GAPPED PALINDROMES 👍 👎
• Finding All Approximate Gapped Palindromes 👍 👎
• Efficient Computation of Palindromes in Sequences with Uncertainties* 👍 👎
• Counting Palindromes in Substrings 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098796)