Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Evolutionary trees can be learned in polynomial time in the two-state general Markov model

Tools
- Tools
+ Tools

Cryan, Mary, Goldberg, Leslie Ann and Goldberg, Paul W. (1998) Evolutionary trees can be learned in polynomial time in the two-state general Markov model. In: 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 08-11 Nov 1998. Published in: 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. pp. 436-445. ISBN 0818691727. ISSN 0272-5428.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1109/SFCS.1998.743494

Request Changes to record.

Abstract

The j-State General Markov Model of evolution (due to Steel) is a stochastic model concerned with the evolution of strings over an alphabet of size j. In particular; the Two-State General Markov Model of evolution generalises the well-known Cavender-Farris-Neyman model of evolution by removing the symmetry restriction (which requires that the probability that a '0' turns into a '1' along mt edge is the same as the probability that a '1' turns into a '0' along the edge). Farach and Kannan showed how to PAC-learn Markov Evolutionary Trees in the Cavender-Farris-Neyman model provided that the target tree satisfies the additional restriction that all pairs of leaves hate a sufficiently high probability of being the same. We show how to remove both restrictions and thereby obtain the first polynomial-time PAC-learning algorithm (in the sense of Kearns et al.) far the general class of Two-State Markov Evolutionary Trees.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings.
Publisher: IEEE
ISBN: 0818691727
ISSN: 0272-5428
Official Date: 1998
Dates:
DateEvent
1998Published
Number of Pages: 4
Page Range: pp. 436-445
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Paper
Title of Event: 39th Annual Symposium on Foundations of Computer Science
Type of Event: Other
Location of Event: Palo Alto, CA
Date(s) of Event: 08-11 Nov 1998

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us