The following pages link to Tandy J. Warnow (Q1575711):
Displaying 50 items.
- (Q242861) (redirect page) (← links)
- (Q1293864) (redirect page) (← links)
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology (Q1293865) (← links)
- Kaikoura tree theorems: Computing the maximum agreement subtree (Q1313765) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- High-performance algorithm engineering for computational phylogenetics (Q1610603) (← links)
- Steps toward accurate reconstructions of phylogenies from gene-order data. (Q1872721) (← links)
- A few logs suffice to build (almost) all trees. II (Q1960520) (← links)
- Scalable and accurate phylogenetic placement using pplacer-XR (Q2062003) (← links)
- Comparing methods for species tree estimation with gene duplication and loss (Q2062005) (← links)
- Absolute convergence: True trees from short sequences (Q2768289) (← links)
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining (Q2768291) (← links)
- (Q2779680) (← links)
- (Q3138927) (← links)
- (Q3138970) (← links)
- (Q3140412) (← links)
- (Q3140442) (← links)
- Triangulating 3-Colored Graphs (Q4012447) (← links)
- Computing the Local Consensus of Trees (Q4210128) (← links)
- (Q4228474) (← links)
- A few logs suffice to build (almost) all trees (I) (Q4238440) (← links)
- (Q4250156) (← links)
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters (Q4268873) (← links)
- Tree Compatibility and Inferring Evolutionary History (Q4290914) (← links)
- Triangulating Vertex-Colored Graphs (Q4296524) (← links)
- Inferring Evolutionary History From DNA Sequences (Q4305354) (← links)
- (Q4342904) (← links)
- Mathematical approaches to comparative linguistics (Q4350853) (← links)
- (Q4375729) (← links)
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies (Q4376199) (← links)
- (Q4410143) (← links)
- (Q4410149) (← links)
- (Q4411282) (← links)
- (Q4417678) (← links)
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining (Q4458876) (← links)
- Constructing big trees from short sequences (Q4572010) (← links)
- Computational Phylogenetics (Q4599297) (← links)
- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time (Q4801149) (← links)
- The Performance of Phylogenetic Methods on Trees of Bounded Diameter (Q4801156) (← links)
- Tree Reconstruction from Partial Orders (Q4842119) (← links)
- (Q4875201) (← links)
- (Q4875203) (← links)
- (Q4886035) (← links)
- (Q4886095) (← links)
- Determining the Evolutionary Tree Using Experiments (Q4895795) (← links)
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
- Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss (Q5041802) (← links)
- Tree reconstruction from partial orders (Q5060131) (← links)
- TRACTION: Fast Non-Parametric Improvement of Estimated Gene Trees (Q5091730) (← links)
- (Q5111790) (← links)
- Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL (Q5111839) (← links)
