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

Inferring evolutionary trees with strong combinatorial evidence

Tools
- Tools
+ Tools

Berry, Vincent and Gascuel, Olivier (1998) Inferring evolutionary trees with strong combinatorial evidence. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

[img]
Preview
PDF
WRAP_cs-rr-341.pdf - Other - Requires a PDF viewer.

Download (503Kb) | Preview

Request Changes to record.

Abstract

We consider the problem of inferring the evolutionary tree of a set of n species. We propose a quartet reconstruction method which specifically produces trees whose edges have strong combinatorial evidence. Let Q be a set of resolved quartets defined on the studied species, the method computes the unique maximum subset Q<sup>*</sup> of Q which is equivalent to a tree and outputs the corresponding tree as an estimate of the species' phylogeny. We use a characterization of the subset Q<sup>*</sup> due to (Bandelt86) to provide an O(n<sup>4</sup>) incremental algorithm for this variant of the NP-hard quartet consistency problem. Moreover, when chosing the resolution of the quartets by the Four-Point Method (FPM) and considering the Cavender-Farris model of evolution, we show that the convergence rate of the Q<sup>*</sup> method is at worst polynomial when the maximum evolutive distance between two species is bounded. We complete these theoretical results by an experimental study on real and simulated data sets. The results show that (i) as expected, the strong combinatorial constraints it imposes on each edge leads the Q<sup>*</sup> method to propose very few incorrect edges; (ii) more surprisingly, the method infers trees with a relatively high degree of resolution.

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Phylogeny -- Molecular aspects, Genetic algorithms
Series Name: Department of Computer Science Research Report
Publisher: University of Warwick. Department of Computer Science
Place of Publication: Coventry, UK
Official Date: 1998
Dates:
DateEvent
1998Completion
Number: Number 341
Number of Pages: 37
DOI: CS-RR-341
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Funder: European Commission (EC)
Related URLs:
  • Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

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