Algorithms for compact letter displays: comparison and evaluation
DOI10.1016/j.csda.2006.09.035zbMath1452.62555OpenAlexW2140408741WikidataQ57206246 ScholiaQ57206246MaRDI QIDQ1020871
Jiong Guo, Rolf Niedermeier, Hans-Peter Piepho, Jens Gramm, Ramona Schmid, Falk Hüffner
Publication date: 2 June 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2006.09.035
Computational methods for problems pertaining to statistics (62-08) Applications of statistics to biology and medical sciences; meta analysis (62P10) Analysis of algorithms and problem complexity (68Q25) Paired and multiple comparisons; multiple testing (62J15)
Related Items (7)
Uses Software
Cites Work
- Sequentially rejective pairwise testing procedures
- Multiple Comparisons of Biodiversity
- Multiple Comparisons
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Small Sample Inference for Fixed Effects from Restricted Maximum Likelihood
- NP-completeness: A retrospective
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for compact letter displays: comparison and evaluation