Algorithms for compact letter displays: Comparison and evaluation

Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multiple comparisons. A heuristic previously proposed for this task is compared with two new algorithmic approaches. The latter rely on the equivalence of computing compact letter displays to computing clique covers in graphs, a problem that is well-studied in theoretical computer science. A thorough discussion of the three approaches aims to give a comparison of the algorithms’ advantages and disadvantages. The three algorithms are compared in a series of experiments on simulated and real data, e.g., using data from wheat and triticale yield trials. Key words: multiple pairwise comparison, line display, NP-hard problem, graph problem, clique cover, efficient algorithm

• Type: Journal
• Year: 2007
• Where: CSDA
• Authors: Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid
• Keywords: Compact Letter Displays, CSDA 2007, Multiple Comparisons, Multiple Pairwise Comparison