The set reduction algorithm is based on set theory and Boolean algebra rather than the graph-theoretic approach. Time trials with a small file of organic chemical structures indicate that the algorithm can be economically used for substructure (or complete structure) sequential searches on a file containing 30,000-50,000 computer-coded structures. (3 references) (Author/NH)