- Journal of Bioinformatics and Computational Biology Vol. 7, No. 4 (2009) 625644
- Journal of Computer and System Sciences 74 (2008) 850869 www.elsevier.com/locate/jcss
- Using Semi-definite Programming to Enhance Supertree Resolvability
- ISRAEL JOURNAL OF ECOLOGY & EVOLUTION, Vol. 52, 2006, pp. 443459 E-mail: ssagi@research.haifa.ac.il
- Quartets MaxCut: A Divide and Conquer Quartets Algorithm
- Journal of Computer and System Sciences 73 (2007) 10781089 www.elsevier.com/locate/jcss
- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes
- Restricting SBH Ambiguity via Restriction Enzymes
- Analytic solutions of maximum likelihood on forks of four taxa q
- Rheinheimera chironomi sp. nov., isolated from a chironomid (Diptera; Chironomidae) egg mass
- Discrete Applied Mathematics 155 (2007) 857867 www.elsevier.com/locate/dam
- Maximum Likelihood on Four Taxa Phylogenetic Trees: Analytic Solutions
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 15, Number 1, 2008
- Fast and Reliable Reconstruction of Phylogenetic Trees with Very Short Edges
- Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden
- A Novel Technique for Detecting Putative Horizontal Gene Transfer in the Sequence Space
- Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
- A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks
- Structural relatedness via flow networks in protein sequence space Zakharia M. Frenkel a,, Zeev M. Frenkel a
- Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic
- Journal of Bioinformatics and Computational Biology Vol. 5, No. 3 (2007) 717738
- Using Max Cut to Enhance Rooted Trees Consistency
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 13, Number 3, 2006
- Maximum Likelihood Jukes-Cantor Triplets: Analytic Solutions Benny Chor,* Michael D. Hendy, and Sagi Snir
- Society of Systematic Biologists Molecular Clock Fork Phylogenies: Closed Form Analytic Maximum Likelihood Solutions
- Reconstructing approximate phylogenetic trees from quartet samples Raphael Yuster
- Connected Coloring Completion for General Graphs: Algorithms and Complexity
- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
- Efficient Approximation of Convex Recolorings Shlomo Moran1,
- Research Plan Sagi Snir 1 Analytical Approaches in Comparative Genomics
