A new research paper introduces and studies quality control problems over sequences, focusing on distinguishing truly random sequences from those with an unusual frequency of specific patterns. The work extends previous research on quality control for graphs to sequences of characters and real-valued sequences. The paper presents algorithms that can solve these pattern counting problems efficiently, running in polynomial time with respect to the pattern length, by leveraging the asymmetric nature of quality control definitions. AI
RANK_REASON Academic paper on a theoretical computer science topic. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
