We study coverage processes where each draw reveals a ℓ-sized subset of [𝑛]. Motivated by DNA-sequencing, we analyze linear and cyclic window models, derive exact and asymptotic results, compare all uniform ℓ-regular models, prove bounds, and conjecture monotonicity while proving the conjecture for broad families of special models.