# ------------------------------------------------ # CITATION.cff file created with {cffr} R package # See also: https://docs.ropensci.org/cffr/ # ------------------------------------------------ cff-version: 1.2.0 message: 'To cite package "cldreducer" in publications use:' type: software license: MIT title: 'cldreducer: Reduce Compact Letter Displays' version: 0.2.0 abstract: Reduces compact letter displays (CLDs) of all pairwise comparisons. A CLD gives two groups a common letter exactly when they are not significantly different. The package finds a display with the fewest letter assignments that keeps every one of these relationships. This is the assignment-minimum clique covering problem of Ennis, Fayle, and Ennis (2012) , solved as a mixed-integer linear program with 'HiGHS'. Among the displays with the fewest assignments, it returns one fixed canonical display, so the result does not depend on the solver. The package includes the wheat yield example of Piepho (2004) . authors: - family-names: Ennis given-names: John email: john.m.ennis@aigora.com preferred-citation: type: manual title: 'cldreducer: Reduce Compact Letter Displays' authors: - family-names: Ennis given-names: John email: john.m.ennis@aigora.com year: '2026' notes: R package version 0.2.0 url: https://github.com/aigorahub/cld-reducer repository: https://cran.r-universe.dev repository-code: https://github.com/aigorahub/cld-reducer commit: 9a2689eb9d65e1e71ef16012fa4769b501af57d1 url: https://github.com/aigorahub/cld-reducer date-released: '2026-10-21' contact: - family-names: Ennis given-names: John email: john.m.ennis@aigora.com references: - type: article title: Assignment-Minimum Clique Coverings authors: - family-names: Ennis given-names: John M. - family-names: Fayle given-names: Charles M. - family-names: Ennis given-names: Daniel M. journal: ACM Journal of Experimental Algorithmics volume: '17' notes: Article 1.5 year: '2012' doi: 10.1145/2133803.2275596