From: Scalable prediction by partial match (PPM) and its application to route prediction
 | Complexity | Parallel | Probabilistic |
---|---|---|---|
Bernstein and Kornhauser (1996) | O(n2) | No | Yes |
PPM-A (Cleary and Witten 1984) | O(n2) | No | Yes |
PPM-B (Cleary and Witten 1984) | O(n2) | No | Yes |
PPM-C (Moffat 1990) | O(n2) | No | Yes |
PPM-D (Moffat 1990) | O(n2) | No | Yes |
Cleary and Witten (1995) | O(n2) | No | Yes |
Teahan (1995) | O(n2) | No | Yes |
Joel and Sirota (2012) | O(n2) | No | Yes |
Effros (2000) | O(n2) | No | Yes |
PPM* (Hiroyuki et al. 2005) | O(n2) | No | Yes |
Celikel (2005) | O(n2) | No | Yes |
Proposed PPM | O(n2) | Yes | Yes |