The cohomology algorithm is significantly faster for filtered clique complexes, empirically.
This phenomenon been has widely replicated [1]}, [2]}, and substantial work has been devoted to understanding this asymmetry; see for example [3]}, [4]}.
