John Tsang  Home/Search
Context
Related
| monod.uwaterloo.ca...00jsctthesis.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: monod.uwaterloo.ca/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Phylogenetic analysis, or the inference of evolutionary history is done routinely by biologists and is one of the most important problems in systematic biology. In this thesis, we study two computational problems in the area. First, we study the evolutionary tree reconstruction problem under the character compatibility (CC) paradigm and give a polynomial time approximation scheme (PTAS) for a variation of the formulation called fractional character compatibility (FCC), which has been proven to... (Update)
Similar documents based on text: More All
0.7: A Collapsing Method for Efficient Recovery of Optimal Edges in.. - Hu (2002) (Correct)
0.6: Multi-dimensional Interval Routing Schemes - Ganjali (2001) (Correct)
0.6: Determining Analytical Potential Energy Functions of Diatomic.. - Huang (2001) (Correct)
BibTeX entry: (Update)
@misc{ tsang-approximation,
author = "John Tsang",
title = "An Approximation Algorithm for Character Compatibility and Fast Quartet-based
Phylogenetic Tree Comparison",
url = "citeseer.ist.psu.edu/tsang00approximation.html" }
Citations (may not include all citations):149 Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al. - 1995
146 The neighbor-joining method: A new method for reconstructing.. (context) - Saitou, Nei - 1987
89 Computational complexity of inferring phylogenies by compati.. (context) - Day, Sanko - 1986
83 The complexity of reconstructing trees from qualitative char.. (context) - Steel - 1992
81 Introduction to computational molecular biology PWS Publishi.. (context) - Meidanis, Setubal - 1997
74 Evolutionary trees from DNA sequences: A maximum likelihood .. (context) - Felsenstein - 1981
68 The rectilinear steiner tree problem is NP{Complete SIAM J (context) - Garey, Johnson - 1977
42 A simple method for estimating evolutionary rates of base su.. (context) - Kimura - 1980
37 Numerical methods for inferring evolutionary trees The Quart.. (context) - Felsenstein - 1982
34 Proof verication and intractability of approximation problem.. (context) - Arora, Lund et al. - 1992
33 Kaikoura tree theorems: computing the maximum agreement subt.. (context) - Steel, Warnow - 1993
25 A practical algorithm for recovering the best supported edge.. - Berry, Bryant et al. - 2000
24 Seq-Gen: an application for the monte carlo simulation of dn.. (context) - Rambaut, Grassly - 1996
19 Orchestrating quartets: approximation and data correction Pr.. - Jiang, Kearney et al. - 1998
18 Unlikelihood that minimal phylogenies for a realistic biolog.. (context) - Graham, Foulds - 1982
[Article contains additional citations not shown here]
Documents on the same site (http://monod.uwaterloo.ca/papers/): More
Estimating DNA Sequence Entropy - Lanctot, Li, Yang (2000) (Correct)
Drug Discovery in the Bioinformatics Age - Duggan, Fejes, Ingram, Salazar.. (2000) (Correct)
A Practical Algorithm for Recovering the Best.. - Berry, Jiang.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC