A deep neural network approach for learning intrinsic protein-RNA binding preferences. | 2 | 0.36 | 2018 |
Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data. | 0 | 0.34 | 2016 |
CRISPR Detection from Short Reads Using Partial Overlap Graphs. | 0 | 0.34 | 2015 |
Computational thinking in life science education. | 7 | 0.76 | 2014 |
String graph construction using incremental hashing. | 8 | 0.49 | 2014 |
Preface: RECOMB 2012. | 0 | 0.34 | 2013 |
CS1001.py: a topic-based introduction to computer science | 1 | 0.36 | 2012 |
Detecting phylogenetic signals in eukaryotic whole genome sequences. | 3 | 0.44 | 2012 |
Approximate Maximum Parsimony and Ancestral Maximum Likelihood | 5 | 0.54 | 2010 |
Linear Separability of Gene Expression Data Sets | 3 | 0.47 | 2010 |
Genomic DNA k-mer spectra: models and modalities | 26 | 1.04 | 2010 |
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network. | 4 | 0.49 | 2009 |
Biological networks: comparison, conservation, and evolution via relative description length. | 6 | 0.49 | 2007 |
Genetic code symmetry and efficient design of GC-constrained coding sequences. | 3 | 0.57 | 2007 |
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites | 12 | 1.18 | 2007 |
Connected coloring completion for general graphs: algorithms and complexity | 20 | 1.30 | 2007 |
Finding a maximum likelihood tree is hard | 23 | 1.82 | 2006 |
The average common substring approach to phylogenomic reconstruction. | 70 | 2.94 | 2006 |
Biological networks: comparison, conservation, and evolutionary trees | 4 | 0.44 | 2006 |
Maximum likelihood molecular clock comb: analytic solutions. | 1 | 0.39 | 2006 |
Time-window analysis of developmental gene expression data with multiple genetic backgrounds | 0 | 0.34 | 2005 |
Maximum likelihood of evolutionary trees: hardness and approximation. | 34 | 4.46 | 2005 |
Maximum likelihood of evolutionary trees is hard | 24 | 4.60 | 2005 |
Information theoretic approaches to whole genome phylogenies | 4 | 0.49 | 2005 |
Adding Hidden Nodes to Gene Networks (Extended Abstract) | 0 | 0.34 | 2004 |
Linear kernels in linear time, or how to save k colors in O(n2) steps | 53 | 2.77 | 2004 |
Tight lower bounds for certain parameterized NP-hard problems | 98 | 3.64 | 2004 |
Ancestral maximum likelihood of evolutionary trees is hard. | 13 | 2.40 | 2003 |
Maximum likelihood on four taxa phylogenetic trees: analytic solutions | 8 | 2.08 | 2003 |
Discovering local structure in gene expression data: the order-preserving submatrix problem. | 201 | 14.24 | 2002 |
Multiple maxima of likelihood in phylogenetic trees: an analytic approach. | 24 | 5.17 | 2000 |
Tracing Traitors | 244 | 47.67 | 2000 |
On the number of ordered factorizations of natural numbers | 3 | 0.71 | 2000 |
Solvability in Asynchronous Environments II: Finite Interactive Tasks | 4 | 0.43 | 1999 |
A Geometric Approach to Betweenness | 54 | 7.60 | 1998 |
From Quartets to Phylogenetic Trees | 6 | 0.59 | 1998 |
Secret Sharing With Public Reconstruction | 21 | 1.91 | 1998 |
Secret Sharing With Public Reconstruction | 21 | 1.91 | 1998 |
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution | 14 | 1.42 | 1998 |
Private Information Retrieval by Keywords. | 71 | 14.39 | 1998 |
Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. | 19 | 2.89 | 1998 |
On constructing radiation hybrid maps. | 13 | 1.48 | 1997 |
Computationally private information retrieval (extended abstract) | 92 | 14.53 | 1997 |
On constructing radiation hybrid maps (extended abstract) | 6 | 0.65 | 1997 |
Communication in key distribution schemes | 19 | 2.91 | 1996 |
On privacy and partition arguments | 5 | 0.51 | 1996 |
Private Information Retrieval. | 10 | 1.21 | 1995 |
Secret Sharing with Public Reconstruction (Extended Abstract) | 1 | 0.35 | 1995 |
Private information retrieval | 502 | 63.11 | 1995 |
The privacy of dense symmetric functions | 7 | 0.74 | 1995 |