Molrep 11.0 is available from here: http://www.ysbl.york.ac.uk/~alexei/molrep.html
Several improvements recently, but the main news is a new algorithm of Multi-copy search. Instead of searching for two copies and then for the next two etc. the program constructs larger multimers (3mers,4mers,5mers,..., as large as it can) and checks them by the translation function. It takes time (30 mins to a couple of hours dependent on the resolution, size of cell, space group) but it is much faster than the previous implementation.
