Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Testing the theory of evolution by comparing phylogenetic trees constructed from five different protein sequences (1982)
    [s.l.] : Nature Publishing Group
    Nature 297 (1982), S. 197-200 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] The theory of evolution predicts that similar phylogenetic trees should be obtained from different sets of character data. We have tested this prediction using sequence data for 5 proteins from 11 species. Our results are consistent with the theory of ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/297197a0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A general approach to proving the minimality of phylogenetic trees illustrated by an example with a set of 23 vertebrates (1979)
    Springer
    Journal of molecular evolution 13 (1979), S. 151-166 
    Details
    ISSN: 1432-1432
    Keywords: Minimal phylogenetic tree ; Cytochrome c ; Molecular evolution ; Upper and lower bounds ; Matching ; Multiple characters ; Minimal spanning tree ; Vertebrates
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary 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 9603440625 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 tree minimal but the method will give an upper and lower bound on the length of minimal trees.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01732869
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A graph theoretic approach to the development of minimal phylogenetic trees (1979)
    Springer
    Journal of molecular evolution 13 (1979), S. 127-149 
    Details
    ISSN: 1432-1432
    Keywords: Cytochrome c ; Phylogenetic tree ; Minimal spanning tree ; Graph theory ; Molecular evolution ; Steiner problem in graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary 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 length of any tree and if a tree is found with a length equal to the lower bound, then no shorter tree can exist.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01732868
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Loss of information in genetic distances (1988)
    [s.l.] : Nature Publishing Group
    Nature 336 (1988), S. 118-118 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] SIRá€"We certainly cannot dispense with DNA sequences when reconstructing evolutionary trees. Diamond1 is correct in identifying 'convergence' as one of the important features for tree reconstruction á€" the tree should not change as more data are collected. But ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/336118a0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...