Searching for authors named "Sagi Snir" – sorted by Relevance.
-
Computational Issues in Phylogenetic Reconstruction: Analytic Maximum Likelihood Solutions, and Convex Recoloring
- , and Convex Recoloring Sagi Snir Computational Issues in Phylogenetic Reconstruction: Analytic Maximum
- Cited by 2 (0 self) – Add To MetaCart
-
Phylogenetic profiling of insertions and deletions in vertebrate genomes, 2005. A Computational Algebra Approach to Systems Biology Brandilyn Stigler, Mathematical Biosciences Institute Synopsis: One goal of systems biology is to predict and modify the be
- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes Sagi Snir and Lior
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient approximation of convex recolorings
- Efficient Approximation of Convex Recolorings ∗ Shlomo Moran † Sagi Snir ‡ June 14, 2005 Abstract
- Cited by 5 (0 self) – Add To MetaCart
-
Convex recolorings of strings and trees: Definitions, hardness results, and algorithms
- Moran † Sagi Snir ‡ December 9, 2007 Abstract A coloring of a tree is convex if the vertices
- Cited by 6 (2 self) – Add To MetaCart
-
Convex recoloring of strings and trees
- of Strings and Trees Shlomo Moran ∗ Sagi Snir † November 2003 Abstract A coloring of a tree is convex
- Cited by 2 (2 self) – Add To MetaCart
-
unknown title
- parsimony-based methods for phylogenetic network reconstruction Guohua Jin 1 , Luay Nakhleh 1 , Sagi Snir 2
- Add To MetaCart
-
Fast and reliable reconstruction of phylogenetic trees with very short edges
- Ilan Gronau ∗ Shlomo Moran † Sagi Snir ‡ Abstract Phylogenetic reconstruction is the problem
- Cited by 1 (0 self) – Add To MetaCart
-
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
- ∗ Sagi Snir † Wing-Kin Sung ‡ February 7, 2007 Abstract The evolutionary process of much of the newly
- Cited by 1 (0 self) – Add To MetaCart
-
Maximum Likelihood of Phylogenetic Networks
- Maximum Likelihood of Phylogenetic Networks Guohua Jin1 , Luay Nakhleh1 , Sagi Snir2 3
- Cited by 6 (3 self) – Add To MetaCart
-
T.: A new linear-time heuristic algorithm for computing the the parsimony score of phylogenetic networks: theoretical bounds and empirical performance
- : Theoretical Bounds and Empirical Performance ⋆ Guohua Jin 1 , Luay Nakhleh 1 , Sagi Snir 2 , and Tamir Tuller
- Cited by 2 (1 self) – Add To MetaCart

