4 papers
Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
MD Nazmul Alam Shanto, Md. Tanzeem Rahat, Md. Manzurul Hasan
We study permutation (jumbled/Abelian) pattern matching over a general alphabet . Given a pattern P of length m and a text T of length n, the classical task is to decide whether…
OBHS: An Optimized Block Huffman Scheme for Real-Time Audio Compression
Muntahi Safwan Mahfi, Md. Manzurul Hasan, Gahangir Hossain
In this paper, we introduce OBHS (Optimized Block Huffman Scheme), a novel lossless audio compression algorithm tailored for real-time streaming applications. OBHS leverages block-…
The Longest Common Bitonic Subsequence: Match-Sensitive Algorithms and Conditional Hardness
Md. Tanzeem Rahat, Md. Manzurul Hasan, Sadia Sharmin
The longest common bitonic subsequence problem asks for a longest common subsequence of two ordered sequences whose values strictly increase and then strictly decrease; either phas…
A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
Md Tanzeem Rahat, Md. Manzurul Hasan, Debajyoti Mondal
Let and be two number sequences of length and , respectively, where . Given a positive number , a common almost increasing sequence is a c…