Package-Name: hgtfp.tbz Title: hgtfp - Implementation of the HGT/FP algorithm (Harmonic Greedy Triplets with the Four-Point Condition). Version: 1 Description: Implementation of the HGT/FP algorithm (Harmonic Greedy Triplets with the Four-Point Condition). Miklos Csuros. Fast recovery of evolutionary trees with thousands of nodes. Journal of Computational Biology, 9(2):277-297. 2002. Miklos Csuros. Fast recovery of evolutionary trees with thousands on nodes. RECOMB 2001, 104:113. Miklos Csuros and Ming-Yang Kao. Provably fast and accurate recovery of evolutionary trees through Harmonic Greedy Triplets. SIAM Journal on Computing, 31:306-322, 2001. Miklos Csuros and Ming-Yang Kao. Recovering evolutionary trees through Harmonic Greedy Triplets. SODA 1999, 261-270 . Miklos Csuros. Reconstructing Phylogenies in Markov Models of Evolution. Ph. D. dissertation, Department of Computer Science, Yale University, 2000. UMI Publication Number: AAT 9991139 [http://wwwlib.umi.com/dissertations/]. Abstract: Author: Miklos Csuros Author-Phone: Author-Fax: Author-Postal: Department of Computer Science and Operations Research, University of Montreal, Canada. Author-Email: csuros@iro.umontreal.ca Maintained-At: http://www.iro.umontreal.ca/~csuros/ ftp.gli.cas.cz/gli/cejchan/neXt/ (Plan 9 port) Distribution-Type: C source Copying-Policy: GPL Keywords: evolutionary trees, phylogenetic trees, molecular biology, distance methods Platforms: Unix csuros@iro.umontreal.ca Plan 9 cej@gli.cas.cz