Uri Keich

According to our database, Uri Keich authored at least 23 papers between 1996 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Exactly Computing the Tail of the Poisson-Binomial Distribution.

Noah Peres, Andrew Ray Lee, Uri Keich

ACM Trans. Math. Softw., 2021

2020

Multiple Competition-Based FDR Control and Its Application to Peptide Detection.

Kristen Emery, Syamand Hasam, William Stafford Noble, Uri Keich

Proceedings of the Research in Computational Molecular Biology, 2020

2017

Progressive Calibration and Averaging for Tandem Mass Spectrometry Statistical Confidence Estimation: Why Settle for a Single Decoy?

Uri Keich, William Stafford Noble

Proceedings of the Research in Computational Molecular Biology, 2017

2016

A Symmetric Length-Aware Enrichment Test.

David Manescu, Uri Keich

J. Comput. Biol., 2016

Accurate pairwise convolutions of non-negative vectors via FFT.

Huon Wilson, Uri Keich

Comput. Stat. Data Anal., 2016

2014

Improving MEME via a two-tiered significance analysis.

Emi Tanaka, Timothy L. Bailey, Uri Keich

Bioinform., 2014

2011

Alignment Constrained Sampling.

Patrick Ng, Uri Keich

J. Comput. Biol., 2011

Improved similarity scores for comparing motifs.

Emi Tanaka, Timothy L. Bailey, Charles E. Grant, William Stafford Noble, Uri Keich

Bioinform., 2011

2009

Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test.

Niranjan Nagarajan, Uri Keich

Comput. Stat., 2009

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

GIMSAN: a Gibbs motif finder with significance analysis.

Patrick Ng, Uri Keich

Bioinform., 2008

FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments.

Niranjan Nagarajan, Uri Keich

Bioinform., 2008

2007

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

2006

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

Proceedings of the Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, 2006

2005

Designing seeds for similarity search in genomic DNA.

Jeremy Buhler, Uri Keich, Yanni Sun

J. Comput. Syst. Sci., 2005

sFFT: A Faster Accurate Computation of the p-Value of the Entropy Score.

Uri Keich

J. Comput. Biol., 2005

Computing the P-value of the information content from an alignment of multiple sequences.

Niranjan Nagarajan, Neil Jones, Uri Keich

Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004

On spaced seeds for similarity search.

Uri Keich, Ming Li, Bin Ma, John Tromp

Discret. Appl. Math., 2004

A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic.

Uri Keich, Niranjan Nagarajan

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003

Genome-Wide Analysis of Bacterial Promoter Regions.

Eleazar Eskin, Uri Keich, Mikhail S. Gelfand, Pavel A. Pevzner

Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

2002

U Subtle motifs: defining the limits of motif finding algorithms.

Uri Keich, Pavel A. Pevzner

Bioinform., 2002

Finding motifs in the twilight zone.

Uri Keich, Pavel A. Pevzner

Bioinform., 2002

1996

A generalization of the Ahlswede-Daykin inequality.

Ron Aharoni, Uri Keich

Discret. Math., 1996