1000 resultados para Kishino-hasegawa Test
Resumo:
The complete sequence of the 16,539 nucleotide mitochondrial genome from the single species of the catfish family Cranoglanididae, the helmet catfish Cranoglanis bouderius, was determined using the long and accurate polymerase chain reaction (LA PCR) method. The nucleotide sequences of C. bouderius mitochondrial DNA have been compared with those of three other catfish species in the same order. The contents of the C. bouderius mitochondrial genome are 13 protein-coding genes, two ribosomal RNA and 22 transfer RNA genes, and a non-coding control region, the gene order of which is identical to that observed in most other vertebrates. Phylogenetic analyses for 13 otophysan fishes were performed using Bayesian method based on the concatenated mtDNA protein-coding gene sequence and the individual protein-coding gene sequence data set. The competing otophysan topologies were then tested by using the approximately unbiased test, the Kishino-Hasegawa test, and the Shimodaira-Hasegawa test. The results show that the grouping ((((Characifonnes, Gymnotiformes), Siluriformes), Cyprinifionnes), outgroup) is the most likely but there is no significant difference between this one and the other alternative hypotheses. In addition, the phylogenetic placement of the family Cranoglanididae among siluriform families was also discussed. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
In simultaneous analyses of multiple data partitions, the trees relevant when measuring support for a clade are the optimal tree, and the best tree lacking the clade (i.e., the most reasonable alternative). The parsimony-based method of partitioned branch support (PBS) forces each data set to arbitrate between the two relevant trees. This value is the amount each data set contributes to clade support in the combined analysis, and can be very different to support apparent in separate analyses. The approach used in PBS can also be employed in likelihood: a simultaneous analysis of all data retrieves the maximum likelihood tree, and the best tree without the clade of interest is also found. Each data set is fitted to the two trees and the log-likelihood difference calculated, giving partitioned likelihood support (PLS) for each data set. These calculations can be performed regardless of the complexity of the ML model adopted. The significance of PLS can be evaluated using a variety of resampling methods, such as the Kishino-Hasegawa test, the Shimodiara-Hasegawa test, or likelihood weights, although the appropriateness and assumptions of these tests remains debated.
Resumo:
The order Fabales, including Leguminosae, Polygalaceae, Quillajaceae and Surianaceae, represents a novel hypothesis emerging from angiosperm molecular phylogenies. Despite good support for the order, molecular studies to date have suggested contradictory, poorly supported interfamilial relationships. Our reappraisal of relationships within Fabales addresses past taxon sampling deficiencies, and employs parsimony and Bayesian approaches using sequences from the plastid regions rbcL (166 spp.) and matK (78 spp.). Five alternative hypotheses for interfamilial relationships within Fabales were recovered. The Shimodaira-Hasegawa test found the likelihood of a resolved topology significantly higher than the one calculated for a polytomy, but did not favour any of the alternative hypotheses of relationship within Fabales. In the light of the morphological evidence available and the comparative behavior of rbcL and matK, the topology recovering Polygalaceae as sister to the rest of the order Fabales with Leguminosae more closely related to Quillajaceae + Surianaceae, is considered the most likely hypothesis of interfamilial relationships of the order. Dating of selected crown clades in the Fabales phylogeny using penalized likelihood suggests rapid radiation of the Leguminosae, Polygalaceae, and (Quillajaceae + Surianaceae) crown clades.
Resumo:
In a range test, one party holds a ciphertext and needs to test whether the message encrypted in the ciphertext is within a certain interval range. In this paper, a range test protocol is proposed, where the party holding the ciphertext asks another party holding the private key of the encryption algorithm to help him. These two parties run the protocol to implement the test. The test returns TRUE if and only if the encrypted message is within the certain interval range. If the two parties do not conspire, no information about the encrypted message is revealed from the test except what can be deduced from the test result. Advantages of the new protocol over the existing related techniques are that it achieves correctness, soundness, °exibility, high e±ciency and privacy simultaneously.