Ron Shamir

Orcid: 0000-0003-1889-9870

Affiliations:
  • Tel Aviv University, Blavatnik School of Computer Science, Israel


According to our database1, Ron Shamir authored at least 167 papers between 1986 and 2023.

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

Awards

ACM Fellow

ACM Fellow 2012, "For contributions to bioinformatics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Time-dependent Iterative Imputation for Multivariate Longitudinal Clinical Data.
CoRR, 2023

2022
Parameterized syncmer schemes improve long-read mapping.
PLoS Comput. Biol., October, 2022

Data Set-Adaptive Minimizer Order Reduces Memory Usage in <i>k</i>-Mer Counting.
J. Comput. Biol., 2022

The DOMINO web-server for active module identification analysis.
Bioinform., 2022

2021
Sorting cancer karyotypes using double-cut-and-joins, duplications and deletions.
Bioinform., 2021

2020 Outstanding contributions to ISCB award: Judith Blake.
Bioinform., 2021

2020 ISCB accomplishments by a Senior Scientist Award: Steven Salzberg.
Bioinform., 2021

2020 ISCB Innovatory Award: Xiaole Shirley Liu.
Bioinform., 2021

2020 ISCB Overton Prize: Jian Peng.
Bioinform., 2021

Improving the efficiency of de Bruijn graph construction using compact universal hitting sets.
Proceedings of the BCB '21: 12th ACM International Conference on Bioinformatics, 2021

2020
MONET: Multi-omic module discovery by omic selection.
PLoS Comput. Biol., 2020

PlasClass improves plasmid sequence classification.
PLoS Comput. Biol., 2020

2019 Outstanding Contributions to ISCB Awarded to Barb Bryant.
Bioinform., 2020

Bonnie Berger named ISCB 2019 ISCB Accomplishments by a Senior Scientist Award recipient.
Bioinform., 2020

PRODIGY: personalized prioritization of driver genes.
Bioinform., 2020

2019
2019 ISCB Innovator Award recognizes William Stafford Noble.
F1000Research, 2019

2019 ISCB Overton Prize: Christophe Dessimoz.
F1000Research, 2019

PROMO: an interactive tool for analyzing clinically-labeled multi-omic cancer datasets.
BMC Bioinform., 2019

NEMO: cancer subtyping by integration of partial multi-omic data.
Bioinform., 2019

2018
2018 ISCB accomplishments by a senior scientist award.
PLoS Comput. Biol., 2018

2018 outstanding contributions to ISCB award: Russ Altman.
PLoS Comput. Biol., 2018

Faucet: streaming de novo assembly graph construction.
Bioinform., 2018

2018 ISCB Innovator Award recognizes M. Madan Babu.
Bioinform., 2018

Message from the ISCB: 2018 Outstanding Contributions to ISCB Award: Russ Altman.
Bioinform., 2018

Message from the ISCB: 2018 ISCB Accomplishments by a Senior Scientist Award.
Bioinform., 2018

2018 ISCB Overton Prize awarded to Cole Trapnell.
Bioinform., 2018

ADEPTUS: a discovery tool for disease prediction, enrichment and network analysis based on profiles from many diseases.
Bioinform., 2018

2017
Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.
PLoS Comput. Biol., 2017

Extracting replicable associations across multiple studies: Empirical Bayes algorithms for controlling the false discovery rate.
PLoS Comput. Biol., 2017

A Linear-Time Algorithm for the Copy Number Transformation Problem.
J. Comput. Biol., 2017

Sorting by Cuts, Joins, and Whole Chromosome Duplications.
J. Comput. Biol., 2017

Reconstructing cancer karyotypes from short read data: the half empty and half full glass.
BMC Bioinform., 2017

Recycler: an algorithm for detecting plasmids from de novo assembly graphs.
Bioinform., 2017

Improving the performance of minimizers and winnowing schemes.
Bioinform., 2017

Complexity and algorithms for copy-number evolution problems.
Algorithms Mol. Biol., 2017

2016
Compact Universal k-mer Hitting Sets.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Copy-Number Evolution Problems: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

2015
Design of shortest double-stranded DNA sequences covering all <i>k</i>-mers with applications to protein-binding microarrays and synthetic enhancers.
Bioinform., 2015

A hierarchical Bayesian model for flexible module discovery in three-way time-series data.
Bioinform., 2015

2014
Fast lossless compression via cascading Bloom filters.
BMC Bioinform., 2014

2013
Dissection of Regulatory Networks that Are Altered in Disease via Differential Co-expression.
PLoS Comput. Biol., 2013

RAP: Accurate and Fast Motif Finding Based on Protein-Binding Microarray Data.
J. Comput. Biol., 2013

Systematic inference of highways of horizontal gene transfer in prokaryotes.
Bioinform., 2013

2012
Network-Induced Classification Kernels for Gene Expression Profile Analysis.
J. Comput. Biol., 2012

Constructing Logical Models of Gene Regulatory Networks by Integrating Transcription Factor-DNA Interactions with Expression Data: An Entropy-Based Approach.
J. Comput. Biol., 2012

MGMR: leveraging RNA-Seq population data to optimize expression estimation.
BMC Bioinform., 2012

Gene Regulation, Protein Networks and Disease: A Computational Perspective.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

SPIKE: a database of highly curated human signaling pathways.
Nucleic Acids Res., 2011

An O(n<sup>3/2</sup>sqrt(log(n))) algorithm for sorting by reciprocal translocations.
J. Discrete Algorithms, 2011

Preface: 2<sup>nd</sup> Satellite Meeting on Bioinformatics Education, Research in Computational Molecular Biology (RECOMB-BE 2010).
J. Comput. Biol., 2011

Detecting Highways of Horizontal Gene Transfer.
J. Comput. Biol., 2011

Understanding Gene Sequence Variation in the Context of Transcription Regulation in Yeast.
Proceedings of the Research in Computational Molecular Biology, 2011

Using Computational Biology Methods to Improve Post-silicon Microprocessor Testing.
Proceedings of the Hardware and Software: Verification and Testing, 2011

2010
A Faster Algorithm for Simultaneous Alignment and Folding of RNA.
J. Comput. Biol., 2010

Topology-Free Querying of Protein Interaction Networks.
J. Comput. Biol., 2010

Minimally perturbing a gene regulatory network to avoid a disease phenotype: the glioma network as a test case.
BMC Syst. Biol., 2010

Discovering Transcriptional Modules by Combined Analysis of Expression Profiles and Regulatory Sequences.
Proceedings of the Research in Computational Molecular Biology, 2010

Detecting Highways of Horizontal Gene Transfer.
Proceedings of the Comparative Genomics - International Workshop, 2010

2009
Torque: topology-free querying of protein interaction networks.
Nucleic Acids Res., 2009

Faster pattern matching with character classes using prime number encoding.
J. Comput. Syst. Sci., 2009

Sorting Cancer Karyotypes by Elementary Operations.
J. Comput. Biol., 2009

Matching with don't-cares and a small number of mismatches.
Inf. Process. Lett., 2009

Increasing the Power of Association Studies by Imputation-based Sparse Tag SNP Selection.
Commun. Inf. Syst., 2009

Identifying functional modules using expression profiles and confidence-scored protein interactions.
Bioinform., 2009

Assessing the Quality of Whole Genome Alignments in Bacteria.
Adv. Bioinformatics, 2009

2008
Computational Problems in Perfect Phylogeny Haplotyping: Typing without Calling the Allele.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Evolution and Selection in Yeast Promoters: Analyzing the Combined Effect of Diverse Transcription Factor Binding Sites.
PLoS Comput. Biol., 2008

Sorting Genomes with Centromeres by Translocations.
J. Comput. Biol., 2008

SPIKE - a database, visualization and analysis tool of cellular signaling pathways.
BMC Bioinform., 2008

A Faster Algorithm for RNA Co-folding.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles.
Proceedings of the Research in Computational Molecular Biology, 2008

2007
Improved algorithms for the random cluster graph model.
Random Struct. Algorithms, 2007

Special issue on computational molecular biology.
J. Comput. Syst. Sci., 2007

Sorting by Reciprocal Translocations via Reversals Theory.
J. Comput. Biol., 2007

Preface.
Discret. Appl. Math., 2007

Identification of functional modules using network topology and high-throughput data.
BMC Syst. Biol., 2007

GEVALT: An integrated software tool for genotype analysis.
BMC Bioinform., 2007

Rearrangements in Genomes with Centromeres Part I: Translocations.
Proceedings of the Research in Computational Molecular Biology, 2007

2006
Reconstructing Chain Functions in Genetic Networks.
SIAM J. Discret. Math., 2006

A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks.
J. Comput. Biol., 2006

A simpler and faster 1.5-approximation algorithm for sorting by transpositions.
Inf. Comput., 2006

Sorting by Translocations Via Reversals Theory.
Proceedings of the Comparative Genomics, 2006

Some Computational Challenges in Today's Bio-medicine.
Proceedings of the Algorithms, 2006

2005
Guest Editors' foreword.
J. Comput. Syst. Sci., 2005

Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data.
J. Comput. Biol., 2005

The Degenerate Primer Design Problem: Theory and Applications.
J. Comput. Biol., 2005

A Block-Free Hidden Markov Model for Genotypes and Its Application to Disease Association.
J. Comput. Biol., 2005

The Incomplete Perfect Phylogeny Haplotype Problem.
J. Bioinform. Comput. Biol., 2005

<i>EXPANDER </i>- an integrative program suite for microarray data analysis.
BMC Bioinform., 2005

Accurate identification of alternatively spliced exons using support vector machine.
Bioinform., 2005

The Factor Graph Network Model for Biological Systems.
Proceedings of the Research in Computational Molecular Biology, 2005

Tag SNP selection in genotype data for maximizing SNP prediction accuracy.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004
Incomplete Directed Perfect Phylogeny.
SIAM J. Comput., 2004

Multilevel Modeling and Inference of Transcription Regulation.
J. Comput. Biol., 2004

Modeling and Analysis of Heterogeneous Regulation in Biological Networks.
J. Comput. Biol., 2004

Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification, and Population Stratification.
INFORMS J. Comput., 2004

Cluster graph modification problems.
Discret. Appl. Math., 2004

A fully dynamic algorithm for modular decomposition and recognition of cographs.
Discret. Appl. Math., 2004

A note on tolerance graph recognition.
Discret. Appl. Math., 2004

PIVOT: Protein Interacions VisualizatiOn Tool.
Bioinform., 2004

Maximum likelihood resolution of multi-block genotypes.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Computational Dissection of Regulatory Networks Using Diverse High-Throughput Data.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Handling Long Targets and Errors in Sequencing by Hybridization.
J. Comput. Biol., 2003

The Restriction Scaffold Problem.
J. Comput. Biol., 2003

Two Notes on Genome Rearrangement.
J. Bioinform. Comput. Biol., 2003

CLICK and EXPANDER: a system for clustering and visualizing gene expression data.
Bioinform., 2003

Scoring clustering solutions by their biological relevance.
Bioinform., 2003

Identifying Blocks and Sub-populations in Noisy SNP Data.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Modeling transcription programs: inferring binding site activity and dose-response model optimization.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Chain functions and scoring functions in genetic networks.
Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology, June 29, 2003

2002
Foreword.
J. Comput. Syst. Sci., 2002

Large Scale Sequencing by Hybridization.
J. Comput. Biol., 2002

On the Complexity of Positional Sequencing by Hybridization.
J. Comput. Biol., 2002

On the Generality of Phylogenies from Incomplete Directed Characters.
Proceedings of the Algorithm Theory, 2002

Discovering statistically significant biclusters in gene expression data.
Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

The degenerate primer design problem.
Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

2001
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.
SIAM J. Comput., 2001

On the Complexity of Positional Sequencing by Hybridization
Electron. Colloquium Comput. Complex., 2001

Complexity classification of some edge modification problems.
Discret. Appl. Math., 2001

A Chemical-Distance-Based Test for Positive Darwinian Selection.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Computational expansion of genetic networks.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

2000
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem.
SIAM J. Comput., 2000

Preface: Special RECOMB 2000 Issue.
J. Comput. Biol., 2000

Algorithms for Optical Mapping.
J. Comput. Biol., 2000

An Algorithm Combining Discrete and Continuous Methods for Optical Mapping.
J. Comput. Biol., 2000

A clustering algorithm based on graph connectivity.
Inf. Process. Lett., 2000

Foreword.
Discret. Appl. Math., 2000

Center CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis.
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

Spectrum Alignment: Efficient Resequencing by Hybridization.
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

Incomplete Directed Perfect Phylogeny.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs.
SIAM J. Comput., 1999

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals.
SIAM J. Comput., 1999

Construction of Physical Maps from Oligonucleotide Fingerprints Data.
J. Comput. Biol., 1999

Clustering Gene Expression Patterns.
J. Comput. Biol., 1999

Faster Subtree Isomorphism.
J. Algorithms, 1999

Bounded Degree Interval Sandwich Problems.
Algorithmica, 1999

An algorithm for clustering cDNAs for gene expression analysis.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

1998
The median problems for breakpoints are NP-complete
Electron. Colloquium Comput. Complex., 1998

The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Satisfiability Problems on Intervals and Unit Intervals.
Theor. Comput. Sci., 1997

Realizing Interval Graphs with Size and Distance Constraints.
SIAM J. Discret. Math., 1997

1996
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques.
SIAM J. Comput., 1996

Physical Maps and Interval Sandwich Problems: Bounded Degrees Help.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Four Strikes Against Physical Mapping of DNA.
J. Comput. Biol., 1995

Graph Sandwich Problems.
J. Algorithms, 1995

Interval Graphs with Side (and Size) Constraints.
Proceedings of the Algorithms, 1995

1994
The Domatic Number Problem on Some Perfect Graph Families.
Inf. Process. Lett., 1994

Balancing Problems in Acyclic Networks.
Discret. Appl. Math., 1994

Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs.
Algorithmica, 1994

Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio.
Math. Program., 1993

Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach.
J. ACM, 1993

A fast algorithm for constructing monge sequences in transportation problems with forbidden arcs.
Discret. Math., 1993

Monge and Feasibility Sequences in General Flow Problems.
Discret. Appl. Math., 1993

Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs.
IEEE Trans. Computers, 1992

A polynomial algorithm for an integer quadratic non-separable transportation problem.
Math. Program., 1992

Interval Graphs, Interval Orders and the Consistency of Temporal Events.
Proceedings of the Theory of Computing and Systems, 1992

Algorithms and Complexity for Reasoning about Time.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem.
Oper. Res., 1991

1990
Minimizing the number of tardy job units under release time constraints.
Discret. Appl. Math., 1990

Characterization and Algorithms for Greedily Solvable Transportation Problems.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett., 1989

1987
A simplex variant solving an <i>m</i> times <i>d</i> linear program in <i>O(min(m<sup>2</sup>, d<sup>2</sup>)</i> expected number of pivot steps.
J. Complex., 1987

1986
A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only.
Math. Oper. Res., 1986


  Loading...