Efficient identification of k-closed strings

DOI10.1142/S0129054120500288MaRDI QIDQ5859637zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

Hamming distancecombinatorics on wordsborderalgorithms on stringsclosed string

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3984596 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• A classification of trapezoidal words
• Algorithms on Strings
• Closed factorization
• Efficient string matching with k mismatches
• Fast and simple computations using prefix tables under Hamming and edit distance
• How to answer a small batch of RMQs or LCA queries in practice
• On the number of closed factors in a word

Cited in

(6)

• Maximal closed substrings
• On closed-rich words
• Borders and Finite Automata
• On Simon's congruence closure of a string
• Off-line and on-line algorithms for closed string factorization
• Closed factorization

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)