Efficient identification of k-closed strings

DOI10.1142/S0129054120500288zbMATH Open1483.68267OpenAlexW4252983749MaRDI QIDQ5859637FDOQ5859637

Hayam Alamro, Costas S. Iliopoulos, Mai Alzamel, Solon P. Pissis, Steven Watts, Wing-Kin Sung

Publication date: 19 April 2021

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

Full work available at URL: https://doi.org/10.1142/s0129054120500288

Recommendations

• Closed factorization
• Locating maximal approximate runs in a string
• Off-line and on-line algorithms for closed string factorization
• Efficient string matching with k mismatches
• On approximate enhanced covers under Hamming distance

zbMATH Keywords

Hamming distancecombinatorics on wordsborderalgorithms on stringsclosed string

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• Algorithms on Strings
• A classification of trapezoidal words
• Closed factorization
• Title not available (Why is that?)
• Efficient string matching with k mismatches
• Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
• On the Number of Closed Factors in a Word
• How to answer a small batch of RMQs or LCA queries in practice

Cited In (3)

• Off-line and on-line algorithms for closed string factorization
• On closed-rich words
• On Simon's congruence closure of a string

This page was built for publication: Efficient identification of \(k\)-closed strings

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