Approximate Palindromes in Strings: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2114:21, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,253 bytes +1,253‎ Created page with "Title: Approximate Palindromes in Strings Research Question: How can we find approximate palindromes in a string with a maximum number of errors? Methodology: The authors introduce a novel definition of approximate palindromes in strings and provide an algorithm to find all maximal approximate palindromes in a string with up to k errors. Their definition is based on the usual edit operations of approximate pattern matching, and the algorithm they give runs in O(k2n) t..."
Retrieved from "https://simplesci.org/wiki/Approximate_Palindromes_in_Strings"