Uri Keich

Orcid: 0000-0002-3209-5011

Affiliations:
  • Cornell University, Ithaca, USA


According to our database1, Uri Keich authored at least 24 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semi-supervised Learning While Controlling the FDR with an Application to Tandem Mass Spectrometry Analysis.
Proceedings of the Research in Computational Molecular Biology, 2024

2021
Exactly Computing the Tail of the Poisson-Binomial Distribution.
ACM Trans. Math. Softw., 2021

2020
Multiple Competition-Based FDR Control and Its Application to Peptide Detection.
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?
Proceedings of the Research in Computational Molecular Biology, 2017

2016
A Symmetric Length-Aware Enrichment Test.
J. Comput. Biol., 2016

Accurate pairwise convolutions of non-negative vectors via FFT.
Comput. Stat. Data Anal., 2016

2014
Improving MEME via a two-tiered significance analysis.
Bioinform., 2014

2011
Alignment Constrained Sampling.
J. Comput. Biol., 2011

Improved similarity scores for comparing motifs.
Bioinform., 2011

2009
Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test.
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.
BMC Bioinform., 2008

GIMSAN: a Gibbs motif finder with significance analysis.
Bioinform., 2008

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

2007
Correcting Base-Assignment Errors in Repeat Regions of Shotgun Assembly.
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.
Proceedings of the Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, 2006

2005
Designing seeds for similarity search in genomic DNA.
J. Comput. Syst. Sci., 2005

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

Computing the P-value of the information content from an alignment of multiple sequences.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004
On spaced seeds for similarity search.
Discret. Appl. Math., 2004

A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003
Genome-Wide Analysis of Bacterial Promoter Regions.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

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

Finding motifs in the twilight zone.
Bioinform., 2002

1996
A generalization of the Ahlswede-Daykin inequality.
Discret. Math., 1996


  Loading...