PubMed Health⌕ Search

Biomedical subjects

M D Hendy

Publications and source records attributed to M D Hendy.

9 recordsLinked to original sources
PubMed1992

Controversy on chloroplast origins.

Controversy exists over the origins of photosynthetic organelles in that contradictory trees arise from different sequence, biochemical and ultrastructural data sets. We propose a testable hypothesis which explains this inconsistency as a result of the differing GC contents of sequences. We report that current methods of tree reconstruction tend to group sequences with similar GC contents irrespective of whether the similar GC content is due to common ancestry or is independently acquired. Nuclear encoded sequences (high GC) give different trees from chloroplast encoded sequences (low GC). We find that current data is consistent with the hypothesis of multiple origins for photosynthetic organelles and single origins for each type of light harvesting complex.

Base Composition↗
PubMed1989

Influenza viruses, comets and the science of evolutionary trees.

The study of phylogeny is becoming increasing scientific in that hypotheses can be tested quantitatively. We report a method of estimating the probabilities of obtaining a tree of a given length from nucleic acid sequence data. The method is applied to the hypothesis of Hoyle & Wickramasinghe that the earth is being continually bombarded by influenza (and other) viruses which originate from comets. A quantitative analysis of sequences from the H1 strain of human influenza viruses contradicts three versions of the Hoyle-Wickramasinghe model. One non-evolutionary version of their model has less than one chance in 10(66) of being correct. A version that allowed extraterrestrial evolution has less than one change in 10(6) of being correct. The sequence data is in agreement with the biological (evolutionary) model. The results are discussed from the aspect of the falsifiability of evolutionary theory.

Base Sequence↗
PubMed1987

TurboTree: a fast algorithm for minimal trees.

A branch and bound algorithm is described for searching rapidly for minimal length trees from biological data. The algorithm adds characters one at a time, rather than adding taxa, as in previous branch and bound methods. The algorithm has been programmed and is available from the authors. A worked example is given with 33 characters and 15 taxa. About 8 x 10(12) binary trees are possible with 15 taxa but the branch and bound program finds the minimal tree in less than 5 min on an IBM PC.

Algorithms↗
PubMed1979

A graph theoretic approach to the development of minimal phylogenetic trees.

The problem of determining the minimal phylogenetic tree is discussed in relation to graph theory. It is shown that this problem is an example of the Steiner problem in graphs which is to connect a set of points by a minimal length network where new points can be added. There is no reported method of solving realistically-sized Steiner problems in reasonable computing time. A heuristic method of approaching the phylogenetic problem is presented, together with a worked example with 7 mammalian cytochrome c sequences. It is shown in this case that the method develops a phylogenetic tree that has the smallest possible number of amino acid replacements. The potential and limitations of the method are discussed. It is stressed that objective methods must be used for comparing different trees. In particular it should be determined how close a given tree is to a mathematically determined lower bound. A theorem is proved which is used to establish a lower bound on the lenghtof any tree and if a tree is found with a length equal to the lower bound, then no shorter tree can exist.

Mathematics↗
PubMed1979

A general approach to proving the minimality of phylogenetic trees illustrated by an example with a set of 23 vertebrates.

We have recently described a method of building phylogenetic trees and have outlined an approach for proving whether a particular tree is optimal for the data used. In this paper we describe in detail the method of establishing lower bounds on the length of a minimal tree by partitioning the data set into subsets. All characters that could be involved in duplications in the data are paired with all other such characters. A matching algorithm is then used to obtain the pairing of characters that reveals the most duplications in the data. This matching may still not account for all nucleotide substitutions on the tree. The structure of the tree is then used to help select subsets of three or more characters until the lower bound found by partitioning is equal to the length of the tree. The tree must then be a minimal tree since no tree can exist with a length less than that of the lower bound. The method is demonstrated using a set of 23 vertebrate cytochrome c sequences with the criterion of minimizing the total number of nucleotide substitutions. There are 131130 7045768798 96033440625 topologically distinct trees that can be constructed from this data set. The method described in this paper does identify 144 minimal tree variants. The method is general in the sense that it can be used for other data and other criteria of length. It need not however always be possible to prove a treee minimal but the method will give an upper and lower bound on the length of minimal trees.

Amino Acid Sequence↗