{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreig4z7vqhtudt363l4exu2pksb67wkbw4mhmbkreouc7ffobb3wzue",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mk7swpzwawz2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.21140v1",
  "publishedAt": "2026-04-24T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Amihood Amir",
    "Ayelet Butman",
    "Michael Itzhaki",
    "Dina Sokol"
  ],
  "textContent": "**Authors:** Amihood Amir, Ayelet Butman, Michael Itzhaki, Dina Sokol\n\nThis paper addresses the problem of identifying palindromic factors in texts that include wildcards -- special characters that match all others. These symbols challenge many classical algorithms, as numerous combinatorial properties are not satisfied in their presence. We apply existing wildcard-LCE techniques to obtain a continuous time-memory tradeoff, and present the first non-trivial linear-space algorithm for computing all maximal palindromes with wildcards, improving the best known time-memory product in certain parameter ranges. Our main results are algorithms to find and approximate all maximal palindromes in a given text. We also generalize both methods to the $k$-mismatches setting, with or without wildcards.",
  "title": "On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches"
}