Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
TNT, a free program for phylogenetic analysis
Through the use of a number of native commands and a simple but powerful scripting language, TNT allows the user an enormous flexibility in phylogenetic analyses or simulations.
TESTING SIGNIFICANCE OF INCONGRUENCE
Quantitative Phyletics and the Evolution of Anurans
THE RETENTION INDEX AND THE RESCALED CONSISTENCY INDEX
- J. Farris
- 1 December 1989
as a measure ol'6t ofa character to a tree, has been widely and successfully employed, but might be capable of some improvement for certain applications. 'The purpose of this note is to dcwrihe two…
Constructing a Significance Test for Incongruence
Angiosperm phylogeny inferred from 18S rDNA, rbcL, and atpB sequences
A phylogenetic analysis of a combined data set for 560 angiosperms and seven outgroups based on three genes, 18S rDNA, rbcL, and atpB representing a total of 4733 bp is presented, resulting in the most highly resolved and strongly supported topology yet obtained for angiosPerms.
PARSIMONY JACKKNIFING OUTPERFORMS NEIGHBOR‐JOINING
- J. Farris, Victor A. Albert, M. Källersjö, D. Lipscomb, A. Kluge
- Medicine, BiologyCladistics : the international journal of the…
- 1 June 1996
For analysis of large matrices, parsimony jackknifing is hundreds of thousands of times faster than extensive branch‐swapping, yet is better able to screen out poorly‐supported groups.
Improvements to resampling measures of group support
- P. Goloboff, J. Farris, M. Källersjö, B. Oxelman, Martıacute;n J Ramıacute;rez, C. Szumik
- 1 August 2003
Several aspects of current resampling methods to assess group support are reviewed. When the characters have different prior weights or some state transformation costs are different, the frequencies…
A Successive Approximations Approach to Character Weighting
- J. Farris
- 1 December 1969
Results indicate that the successive weighting procedure can be highly successful, even when cladistically reliable characters are heavily outnumbered by unreliable ones, and computer simulation tests of the technique are described.