Exactly Computing the Parsimony Scores on Phylogenetic Networks ...
www.ncbi.nlm.nih.gov › PMC3962649
Dynamic programming has been used to provide efficient solutions for finding the exact parsimony score when the network is a phylogenetic tree (Sankoff, 1975; ...
Feb 21, 2014 · Using the principle of maximum parsimony, we can score phylogenetic networks based on the minimum number of state changes across a subset of ...
Feb 21, 2014 · Using the principle of maximum parsimony, we can score phylogenetic networks based on the minimum number of state changes across a subset of ...
People also ask
What is a parsimony score?
What is parsimony in phylogenetic analysis?
How do you construct a phylogenetic tree using parsimony?
Why is the principle of parsimony important in constructing phylogenies?
Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming (vol 21, pg 303, 2014). L Kannan, WC Wheeler. JOURNAL OF ...
Two different definitions of maximum parsimony on networks, “hardwired” and “softwired,” are discussed and the complexity of computing them given a network ...
Lavanya Kannan and Ward C Wheeler. Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming. In JCB, Vol. 21(4):303-319, ...
Using the principle of maximum parsimony, we can score phylogenetic networks based on the minimum number of state changes across a subset of edges of the ...
Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming (vol 21, pg 303, 2014). L Kannan, WC Wheeler. JOURNAL OF ...
May 2, 2012 · Dynamic Programming solution. Dynamic programming is used to provide efficient solutions for finding the exact parsimony score when the network ...
Abstract. Phylogenetic networks are well suited to represent evolutionary histories comprising reticulate evolution. Several methods aiming at reconstructi.