# ------------------------------------------------ # 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.3.5 identifiers: - type: doi value: 10.32614/CRAN.package.cldreducer 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 or distinct letters that keeps every relationship. The optional CLD-sigma objective is the assignment-minimum clique covering problem of Ennis, Fayle, and Ennis (2012) , solved as a mixed-integer linear program with 'HiGHS'. The default CLD-C method selects full maximal cliques with the fewest letters. Among displays with the selected minimum objective, 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.3.5 url: https://github.com/aigorahub/cld-reducer repository: https://aigorahub.r-universe.dev repository-code: https://github.com/aigorahub/cld-reducer commit: b32c42fbcc37bce8c70b3a40887b3c4e0e178abf url: https://github.com/aigorahub/cld-reducer date-released: '2026-10-20' 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