Pattern Maximum Likelihood (PML) is a recent probability-estimation technique that is especially useful when the underlying alphabet is large and some of the symbols have not even been observed. In this talk we determine the PML of several simple samples, describe an algorithm for exact PML calculation, and present simulation results obtained using an efficient heuristic algorithm for calculating the PML distribution.