On problems related to absent subsequences

DOI10.1007/978-3-031-49614-1_26MaRDI QIDQ6606246zbMATH OpenFDO

Authors Zdeněk Troníček

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49614-1_26

zbMATH Keywords

absent subsequencesdirected acyclic subsequence graphdistinguishing wordssubsequence automaton

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• Absent subsequences in words
• Calcul de la distance par les sous-mots
• Combinatorial algorithms for subsequence matching: a survey
• Directed acyclic subsequence graph -- overview
• On Simon's congruence closure of a string
• Operations on DASG
• Searching subsequences
• Subsequences in bounded ranges: matching and analysis problems
• Testing Simon's congruence
• The on-line encyclopedia of integer sequences
• The size of subsequence automaton

Cited in

(4)

• Fast algorithms for window accumulated subsequence matching problem
• Jumbled scattered factors
• Scattered factor universality -- a survey
• Efficiently finding all shortest absent subsequences in a string

This page was built for publication: On problems related to absent subsequences

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