default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUri Keich
Person information
- affiliation: Cornell University, Ithaca, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Jack Freestone, Lukas Käll
, William Stafford Noble, Uri Keich:
Semi-supervised Learning While Controlling the FDR with an Application to Tandem Mass Spectrometry Analysis. RECOMB 2024: 448-453- 2021
- [j17]Noah Peres, Andrew Ray Lee, Uri Keich:
Exactly Computing the Tail of the Poisson-Binomial Distribution. ACM Trans. Math. Softw. 47(4): 35:1-35:19 (2021) - 2020
- [c9]Kristen Emery, Syamand Hasam, William Stafford Noble, Uri Keich:
Multiple Competition-Based FDR Control and Its Application to Peptide Detection. RECOMB 2020: 54-71
2010 – 2019
- 2017
- [c8]Uri Keich, William Stafford Noble:
Progressive Calibration and Averaging for Tandem Mass Spectrometry Statistical Confidence Estimation: Why Settle for a Single Decoy? RECOMB 2017: 99-116 - 2016
- [j16]Huon Wilson, Uri Keich:
Accurate pairwise convolutions of non-negative vectors via FFT. Comput. Stat. Data Anal. 101: 300-315 (2016) - [j15]David Manescu, Uri Keich:
A Symmetric Length-Aware Enrichment Test. J. Comput. Biol. 23(6): 508-525 (2016) - 2015
- [c7]David Manescu, Uri Keich:
A Symmetric Length-Aware Enrichment Test. RECOMB 2015: 224-242 - 2014
- [j14]Emi Tanaka, Timothy L. Bailey, Uri Keich:
Improving MEME via a two-tiered significance analysis. Bioinform. 30(14): 1965-1973 (2014) - 2011
- [j13]Emi Tanaka, Timothy L. Bailey, Charles E. Grant, William Stafford Noble, Uri Keich:
Improved similarity scores for comparing motifs. Bioinform. 27(12): 1603-1609 (2011) - [j12]Patrick Ng, Uri Keich:
Alignment Constrained Sampling. J. Comput. Biol. 18(2): 155-168 (2011)
2000 – 2009
- 2009
- [j11]Niranjan Nagarajan, Uri Keich:
Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test. Comput. Stat. 24(4): 605 (2009) - 2008
- [j10]Niranjan Nagarajan, Uri Keich:
FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments. Bioinform. 24(4): 577-578 (2008) - [j9]Patrick Ng, Uri Keich:
GIMSAN: a Gibbs motif finder with significance analysis. Bioinform. 24(19): 2256-2257 (2008) - [j8]Uri Keich, Hong Gao, Jeffrey S. Garretson, Anand Bhaskar, Ivan Liachko, Justin Donato, Bik K. Tye:
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. 9 (2008) - 2007
- [j7]Degui Zhi, Uri Keich, Pavel A. Pevzner, Steffen Heber, Haixu Tang:
Correcting Base-Assignment Errors in Repeat Regions of Shotgun Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 54-64 (2007) - 2006
- [c6]Patrick Ng, Niranjan Nagarajan, Neil Jones, Uri Keich:
Apples to apples: improving the performance of motif finders and their significance analysis in the Twilight Zone. ISMB (Supplement of Bioinformatics) 2006: 393-401 - 2005
- [j6]Uri Keich:
sFFT: A Faster Accurate Computation of the p-Value of the Entropy Score. J. Comput. Biol. 12(4): 416-430 (2005) - [j5]Jeremy Buhler, Uri Keich, Yanni Sun:
Designing seeds for similarity search in genomic DNA. J. Comput. Syst. Sci. 70(3): 342-363 (2005) - [c5]Niranjan Nagarajan, Neil Jones, Uri Keich:
Computing the P-value of the information content from an alignment of multiple sequences. ISMB (Supplement of Bioinformatics) 2005: 311-318 - 2004
- [j4]Uri Keich, Ming Li, Bin Ma, John Tromp:
On spaced seeds for similarity search. Discret. Appl. Math. 138(3): 253-263 (2004) - [c4]Uri Keich, Niranjan Nagarajan:
A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic. WABI 2004: 111-122 - 2003
- [c3]Eleazar Eskin, Uri Keich, Mikhail S. Gelfand, Pavel A. Pevzner:
Genome-Wide Analysis of Bacterial Promoter Regions. Pacific Symposium on Biocomputing 2003: 29-40 - [c2]Jeremy Buhler, Uri Keich, Yanni Sun:
Designing seeds for similarity search in genomic DNA. RECOMB 2003: 67-75 - 2002
- [j3]Uri Keich, Pavel A. Pevzner:
Finding motifs in the twilight zone. Bioinform. 18(10): 1374-1381 (2002) - [j2]Uri Keich, Pavel A. Pevzner:
U Subtle motifs: defining the limits of motif finding algorithms. Bioinform. 18(10): 1382-1390 (2002) - [c1]Uri Keich, Pavel A. Pevzner:
Finding motifs in the twilight zone. RECOMB 2002: 195-204
1990 – 1999
- 1996
- [j1]Ron Aharoni, Uri Keich:
A generalization of the Ahlswede-Daykin inequality. Discret. Math. 152(1-3): 1-12 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
