Name
Affiliation
Papers
BENNY CHOR
Dept. of Computer Science, Technion Haifa 32000 Israel
85
Collaborators
Citations 
PageRank 
95
2981
520.40
Referers 
Referees 
References 
4054
939
666
Search Limit
1001000
Title
Citations
PageRank
Year
A deep neural network approach for learning intrinsic protein-RNA binding preferences.20.362018
Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data.00.342016
CRISPR Detection from Short Reads Using Partial Overlap Graphs.00.342015
Computational thinking in life science education.70.762014
String graph construction using incremental hashing.80.492014
Preface: RECOMB 2012.00.342013
CS1001.py: a topic-based introduction to computer science10.362012
Detecting phylogenetic signals in eukaryotic whole genome sequences.30.442012
Approximate Maximum Parsimony and Ancestral Maximum Likelihood50.542010
Linear Separability of Gene Expression Data Sets30.472010
Genomic DNA k-mer spectra: models and modalities261.042010
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network.40.492009
Biological networks: comparison, conservation, and evolution via relative description length.60.492007
Genetic code symmetry and efficient design of GC-constrained coding sequences.30.572007
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites121.182007
Connected coloring completion for general graphs: algorithms and complexity201.302007
Finding a maximum likelihood tree is hard231.822006
The average common substring approach to phylogenomic reconstruction.702.942006
Biological networks: comparison, conservation, and evolutionary trees40.442006
Maximum likelihood molecular clock comb: analytic solutions.10.392006
Time-window analysis of developmental gene expression data with multiple genetic backgrounds00.342005
Maximum likelihood of evolutionary trees: hardness and approximation.344.462005
Maximum likelihood of evolutionary trees is hard244.602005
Information theoretic approaches to whole genome phylogenies40.492005
Adding Hidden Nodes to Gene Networks (Extended Abstract)00.342004
Linear kernels in linear time, or how to save k colors in O(n2) steps532.772004
Tight lower bounds for certain parameterized NP-hard problems983.642004
Ancestral maximum likelihood of evolutionary trees is hard.132.402003
Maximum likelihood on four taxa phylogenetic trees: analytic solutions82.082003
Discovering local structure in gene expression data: the order-preserving submatrix problem.20114.242002
Multiple maxima of likelihood in phylogenetic trees: an analytic approach.245.172000
Tracing Traitors24447.672000
On the number of ordered factorizations of natural numbers30.712000
Solvability in Asynchronous Environments II: Finite Interactive Tasks40.431999
A Geometric Approach to Betweenness547.601998
From Quartets to Phylogenetic Trees60.591998
Secret Sharing With Public Reconstruction211.911998
Secret Sharing With Public Reconstruction211.911998
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution141.421998
Private Information Retrieval by Keywords.7114.391998
Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships.192.891998
On constructing radiation hybrid maps.131.481997
Computationally private information retrieval (extended abstract)9214.531997
On constructing radiation hybrid maps (extended abstract)60.651997
Communication in key distribution schemes192.911996
On privacy and partition arguments50.511996
Private Information Retrieval.101.211995
Secret Sharing with Public Reconstruction (Extended Abstract)10.351995
Private information retrieval50263.111995
The privacy of dense symmetric functions70.741995
  • 1
  • 2