Fast algorithms for window accumulated subsequence matching problem

DOI10.1007/S00236-026-00523-4MaRDI QIDQ6844154zbMATH OpenFDO

Authors Zdeněk Troníček

Publication date 16 March 2026

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00236-026-00523-4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• \(k\)-universality of regular languages
• Absent subsequences in words
• Calcul de la distance par les sous-mots
• Combinatorial algorithms for subsequence matching: a survey
• Compact recognizers of episode sequences
• Compressed subsequence matching and packed tree coloring
• Computing longest Lyndon subsequences and longest common Lyndon subsequences
• Directed acyclic subsequence graph -- overview
• Faster subsequence and don't-care pattern matching on compressed texts
• Faster subsequence recognition in compressed strings
• scientific article; zbMATH DE number 1786453 (Why is no real title available?)
• Longest bordered and periodic subsequences
• On problems related to absent subsequences
• Searching subsequences
• Subsequence automata with default transitions
• Subsequence matching and LCS with segment number constraints
• Subsequences in bounded ranges: matching and analysis problems
• Subsequences with gap constraints: complexity bounds for matching and analysis problems
• Subsequences with generalised gap constraints: upper and lower complexity bounds
• Towards approximate matching in compressed strings: local subsequence recognition
• Window Subsequence Problems for Compressed Texts

This page was built for publication: Fast algorithms for window accumulated subsequence matching problem

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