Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FOCS
1998
IEEE

favoriteEmaildiscussreport

83views Theoretical Computer Science» more FOCS 1998»

Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model

13 years 8 months ago

Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model

Download www.csc.liv.ac.uk

Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg

Real-time Traffic

FOCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Fast recovery of evolutionary trees with thousands of nodes

» Optimal phylogenetic reconstruction

» Approximately optimal adaptive learning in opportunistic spectrum access

» Kernelbased discriminative learning algorithms for labeling sequences trees and graphs

» Learning Probabilistic Automata with Variable Memory Length

» Weakly learning DNF and characterizing statistical query learning using Fourier analysis

» Learning PDFA with Asynchronous Transitions

» Approximating the true evolutionary distance between two genomes

» Stability analysis of mixtures of mutagenetic trees

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg

Comments (0)