Testing the theory of evolution: A novel application of combinatorial optimization (Q1084042): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115465048, #quickstatements; #temporary_batch_1706273008033
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Les R. Foulds / rank
Normal rank
 
Property / author
 
Property / author: Les R. Foulds / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:25, 17 June 2024

scientific article
Language Label Description Also known as
English
Testing the theory of evolution: A novel application of combinatorial optimization
scientific article

    Statements

    Testing the theory of evolution: A novel application of combinatorial optimization (English)
    0 references
    1986
    0 references
    This paper's major interest is an objective test by which Darwin's theory of evolution can be falsified. The theory of evolution implies that the phylogenetic trees for corresponding DNA sequences in different species (e.g., the ones coding for haemoglobin A) should imply an identical pattern of ancestry. The DNA sequences are nodes on a graph; a tentative phylogenetic tree is a tree spanning the nodes. The weight assigned to an edge joining two DNA sequences in the graph is the number of corresponding sites in the sequences which have different letters. Because one allows the possibility of uncatalogued DNA sequences, intermediate nodes other than the known DNA sequences are permitted. One criterion for optimising an evolutionary tree, maximum parsimony, leads to the problem of finding the Steiner minimal tree for the nodes under the given weighting scheme. Combinatorial optimisation is used to generate the minimal tree for five families of sequences. Edge removal from a tree partitions the vertices into two classes; this gives rise to a metric on trees which span the nodes. Equiprobability of all possible spanning trees then provides a null hypothesis for statistical testing. Darwin's theory survives unscathed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    biochemical methods
    0 references
    Darwin's theory of evolution
    0 references
    phylogenetic trees
    0 references
    DNA sequences
    0 references
    maximum parsimony
    0 references
    Steiner minimal tree
    0 references
    Combinatorial optimisation
    0 references
    0 references
    0 references