Automatic Enumeration of Intervals of Partial Co- Clones

This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics and Prune and search algorithm to search problem size up to O(2 to the power of 80). This algorithm uses little memory with linear complexity and almost no communication between computing nodes. It is a fast light-weighted tool for researchers who has many relatively small partial clone related problems.