Sagi Snir

Orcid: 0000-0001-5833-7659

According to our database1, Sagi Snir authored at least 56 papers between 2000 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Enforcing Temporal Consistency in Migration History Inference.
J. Comput. Biol., 2024

On the Distribution of Synteny Blocks Under a Neutral Model of Genome Dynamics.
Proceedings of the Comparative Genomics - 21st International Conference, 2024

Gene-Adjacency-Based Phylogenetics Under a Stochastic Gain-Loss Model.
Proceedings of the Comparative Genomics - 21st International Conference, 2024

Privacy Preserving Epigenetic PaceMaker: Stronger Privacy and Improved Efficiency.
Proceedings of the Research in Computational Molecular Biology, 2024

2023
Identifying epigenetic aging moderators using the epigenetic pacemaker.
Frontiers Bioinform., May, 2023

Inferring Temporally Consistent Migration Histories.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Using Generating Functions to Prove Additivity of Gene-Neighborhood Based Phylogenetics - Extended Abstract.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

2022
On the quartet distance given partial information.
J. Graph Theory, 2022

Private Epigenetic PaceMaker Detector Using Homomorphic Encryption - Extended Abstract.
Proceedings of the Bioinformatics Research and Applications - 18th International Symposium, 2022

2020
Inference of mutability landscapes of tumors from single cell sequencing data.
PLoS Comput. Biol., 2020

The Epigenetic Pacemaker: modeling epigenetic states under an evolutionary framework.
Bioinform., 2020

2019
Extending the Evolvability Model to the Prokaryotic World: Simulations and Results on Real Data.
J. Comput. Biol., 2019

Bounds on Identification of Genome Evolution Pacemakers.
J. Comput. Biol., 2019

A New Quartet-Based Statistical Method for Comparing Sets of Gene Trees Is Developed Using a Generalized Hoeffding Inequality.
J. Comput. Biol., 2019

Prokaryotic evolutionary mechanisms accelerate learning.
Discret. Appl. Math., 2019

Greedy Partition Distance Under Stochastic Models - Analytic Results.
Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

2018
Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

2017
Applying meta-analysis to genotype-tissue expression data from multiple tissues to identify eQTLs and increase the number of eGenes.
Bioinform., 2017

2016
A Statistical Framework to Identify Deviation from Time Linearity in Epigenetic Aging.
PLoS Comput. Biol., 2016

2015
Detecting Horizontal Gene Transfer between Closely Related Taxa.
PLoS Comput. Biol., 2015

Gene-Gene Interactions Detection Using a Two-stage Model.
J. Comput. Biol., 2015

2014
On the Compatibility of Quartet Trees.
SIAM J. Discret. Math., 2014

On the number of genomic pacemakers: a geometric approach.
Algorithms Mol. Biol., 2014

Pacemaker Partition Identification.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
Recovering the Treelike Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis.
J. Comput. Biol., 2013

2012
Reconstructing Approximate Phylogenetic Trees from Quartet Samples.
SIAM J. Comput., 2012

Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges.
Random Struct. Algorithms, 2012

Universal Pacemaker of Genome Evolution.
PLoS Comput. Biol., 2012

Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis.
Proceedings of the Research in Computational Molecular Biology, 2012

2011
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds.
ACM Trans. Algorithms, 2011

A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs.
SIAM J. Discret. Math., 2011

Tracing the Most Parsimonious Indel History.
J. Comput. Biol., 2011

2010
Quartets MaxCut: A Divide and Conquer Quartets Algorithm.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

A Novel Technique for Detecting Putative Horizontal Gene Transfer in the Sequence Space.
J. Comput. Biol., 2010

2009
Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

The Net-HMM Approach: Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models.
J. Bioinform. Comput. Biol., 2009

2008
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Convex recolorings of strings and trees: Definitions, hardness results and algorithms.
J. Comput. Syst. Sci., 2008

Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm.
J. Comput. Biol., 2008

Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Fast and reliable reconstruction of phylogenetic trees with very short edges.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Efficient approximation of convex recolorings.
J. Comput. Syst. Sci., 2007

Incorporating homologues into Sequence Embeddings for protein Analysis.
J. Bioinform. Comput. Biol., 2007

Restricting SBH ambiguity via restriction enzymes.
Discret. Appl. Math., 2007

Efficient parsimony-based methods for phylogenetic network reconstruction.
Bioinform., 2007

A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Connected Coloring Completion for General Graphs: Algorithms and Complexity.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Using Max Cut to Enhance Rooted Trees Consistency.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Maximum Likelihood Molecular Clock Comb: Analytic Solutions.
J. Comput. Biol., 2006

Maximum likelihood of phylogenetic networks.
Bioinform., 2006

Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes.
Proceedings of the Research in Computational Molecular Biology, 2006

2005
Using Semi-definite Programming to Enhance Supertree Resolvability.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

The Homology Kernel: A Biologically Motivated Sequence Embedding into Euclidean Space.
Proceedings of the 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2005

2004
Computational issues in phylogenetic reconstruction : analytic maximum likelihood solutions and convex recoloring.
PhD thesis, 2004

2003
Maximum likelihood on four taxa phylogenetic trees: analytic solutions.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

2000
Simple and efficient network decomposition and synchronization.
Theor. Comput. Sci., 2000


  Loading...