A PHP Error was encountered

Severity: Warning

Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests

Filename: helpers/my_audit_helper.php

Line Number: 176

Backtrace:

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url

File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3122
Function: getPubMedXML

File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global

File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword

File: /var/www/html/index.php
Line: 316
Function: require_once

Parametric maximum parsimonious reconstruction on trees. | LitMetric

Parametric maximum parsimonious reconstruction on trees.

Bull Math Biol

Institut de Mathématiques de Luminy CNRS-UMR 6206, Campus de Luminy, Marseille Cedex 9, France.

Published: July 2011

AI Article Synopsis

  • The study examines how transition cost parameters relate to the reconstruction of ancestral binary states (0 or 1) on a phylogenetic tree.
  • Two key thresholds (λ¹n and λ⁰n) are defined for each node in the tree, determining when a state can be reconstructed based on the cost ratios of transitions between states.
  • A dynamic programming algorithm is introduced to calculate these thresholds efficiently, with potential applications in analyzing biological data by quantifying support for reconstructed states and understanding necessary evolutionary cost assumptions.

Article Abstract

We give a formal study of the relationships between the transition cost parameters and the generalized maximum parsimonious reconstructions of unknown (ancestral) binary character states {0,1} over a phylogenetic tree. As a main result, we show there are two thresholds λ¹n and λ⁰n , generally confounded, associated to each node n of the phylogenetic tree and such that there exists a maximum parsimonious reconstruction associating state 1 to n (resp. state 0 to n) if the ratio "10-cost"/"01-cost" is smaller than λ¹n (resp. greater than λ⁰n). We propose a dynamic programming algorithm computing these thresholds in a quadratic time with the size of tree.We briefly illustrate some possible applications of this work over a biological dataset. In particular, the thresholds provide a natural way to quantify the degree of support for states reconstructed as well as to determine what kind of evolutionary assumptions in terms of costs are necessary to a given reconstruction.

Download full-text PDF

Source
http://dx.doi.org/10.1007/s11538-010-9574-8DOI Listing

Publication Analysis

Top Keywords

maximum parsimonious
12
parsimonious reconstruction
8
phylogenetic tree
8
parametric maximum
4
reconstruction trees
4
trees formal
4
formal study
4
study relationships
4
relationships transition
4
transition cost
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!