A generalization of the Ahlswede-Daykin inequality. - Ron Aharoni; Uri Keich (Discret. Math., 1996)

Finding motifs in the twilight zone. - Uri Keich; Pavel A. Pevzner (Bioinform., 2002)

U Subtle motifs: defining the limits of motif finding algorithms. - Uri Keich; Pavel A. Pevzner (Bioinform., 2002)

Genome-Wide Analysis of Bacterial Promoter Regions. - Eleazar Eskin; Uri Keich; Mikhail S. Gelfand; Pavel A. Pevzner (Pacific Symposium on Biocomputing, 2003)

A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic. - Uri Keich; Niranjan Nagarajan (WABI, 2004)

On spaced seeds for similarity search. - Uri Keich; Ming Li 001; Bin Ma 002; John Tromp (Discret. Appl. Math., 2004)

Computing the P-value of the information content from an alignment of multiple sequences. - Niranjan Nagarajan; Neil Jones; Uri Keich (ISMB (Supplement of Bioinformatics), 2005)

sFFT: A Faster Accurate Computation of the p-Value of the Entropy Score. - Uri Keich (J. Comput. Biol., 2005)

Designing seeds for similarity search in genomic DNA. - Jeremy Buhler; Uri Keich; Yanni Sun (J. Comput. Syst. Sci., 2005)

Apples to apples: improving the performance of motif finders and their significance analysis in the Twilight Zone. - Patrick Ng; Niranjan Nagarajan; Neil Jones; Uri Keich (ISMB (Supplement of Bioinformatics), 2006)

Correcting Base-Assignment Errors in Repeat Regions of Shotgun Assembly. - Degui Zhi; Uri Keich; Pavel A. Pevzner; Steffen Heber; Haixu Tang (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments. - Niranjan Nagarajan; Uri Keich (Bioinform., 2008)

GIMSAN: a Gibbs motif finder with significance analysis. - Patrick Ng; Uri Keich (Bioinform., 2008)

Computational detection of significant variation in binding affinity across two sets of sequences with application to the analysis of replication origins in yeast. - Uri Keich; Hong Gao; Jeffrey S. Garretson; Anand Bhaskar; Ivan Liachko; Justin Donato; Bik K. Tye (BMC Bioinform., 2008)

Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test. - Niranjan Nagarajan; Uri Keich (Comput. Stat., 2009)

Improved similarity scores for comparing motifs. - Emi Tanaka; Timothy L. Bailey; Charles E. Grant; William Stafford Noble; Uri Keich (Bioinform., 2011)

Alignment Constrained Sampling. - Patrick Ng; Uri Keich (J. Comput. Biol., 2011)

Improving MEME via a two-tiered significance analysis. - Emi Tanaka; Timothy L. Bailey; Uri Keich (Bioinform., 2014)

Accurate pairwise convolutions of non-negative vectors via FFT. - Huon Wilson; Uri Keich (Comput. Stat. Data Anal., 2016)

A Symmetric Length-Aware Enrichment Test. - David Manescu; Uri Keich (J. Comput. Biol., 2016)

Progressive Calibration and Averaging for Tandem Mass Spectrometry Statistical Confidence Estimation: Why Settle for a Single Decoy? - Uri Keich; William Stafford Noble (RECOMB, 2017)

Multiple Competition-Based FDR Control and Its Application to Peptide Detection. - Kristen Emery; Syamand Hasam; William Stafford Noble; Uri Keich (RECOMB, 2020)

Exactly Computing the Tail of the Poisson-Binomial Distribution. - Noah Peres; Andrew Ray Lee; Uri Keich (ACM Trans. Math. Softw., 2021)

Group-walk: a rigorous approach to group-wise false discovery rate analysis by target-decoy competition. - Jack Freestone; Temana Short; William Stafford Noble; Uri Keich (Bioinform., 2022)

Semi-supervised Learning While Controlling the FDR with an Application to Tandem Mass Spectrometry Analysis. - Jack Freestone; Lukas Käll; William Stafford Noble; Uri Keich (RECOMB, 2024)