QuickJoin - Fast neighbour-joining tree reconstruction

Bioinformatics

Volumn 20, Issue 17, 2004, Pages 3261-3262

  Mailund, Thomas ^a   Pedersen, Christian N S ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; MICROCOMPUTER; NEIGHBOR JOINING METHOD; PHYLOGENETIC TREE; PRIORITY JOURNAL; SPECIES;

EID: 10244219919     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bth359     Document Type: Article

References (6)

1. Bateman,A., Birney,E., Cerruti,L., Durbin,R., Etwiller,L., Eddy,S., Griffiths-Jones,S., Howe,K., Marshall,M. and Sonnhammer,E. (2002) The Pfam protein families database. Nucleic Acids Res., 30, 276-280.
2. Brodal,G., Fagerberg,R., Mailund,T., Pedersen,C. and Phillips,D. (2003) Speeding up neighbour-joining tree construction. Technical Report ALCOMFT-TR-03-102, ALCOM-FT.
3. Finkel,R.A. and Bentley,J.L. (1974) Quad trees: a data structure for retrieval by composite key. Acta Inform., 4, 1-9.
4. Howe,K., Bateman,A. and Durbin,R. (2002) QuickTree: building huge neighbour-joining trees of protein sequences. Bioinformatics, 18, 1546-1547.
5. Saitou,N. and Nei,M. (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol., 4, 406-425.
6. Studier,J.A. and Keppler,K.J. (1988) A note on the neighbor-joining method of Saitou and Nei. Mol. Biol. Evol., 5 729-731.