Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Whelan, S.
Right arrow Articles by Goldman, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Whelan, S.
Right arrow Articles by Goldman, N.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 12 2003
Pages 1556-1563
© 2003 Oxford University Press

Pandit: a database of protein and associated nucleotide domains with inferred trees

Simon Whelan 1,2,*, Paul I. W. de Bakker 3 and Nick Goldman 1,2

1 Department of Zoology, University of Cambridge, Downing Street, Cambridge CB2 3EJ, UK
2 EMBL-European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK
3 Department of Biochemistry, University of Cambridge, 80 Tennis Court Road, Cambridge, CB2 1GA, UK

Received on November 25, 2002 ; revised on February 10, 2003 ; accepted on February 21, 2003

Motivation: A large, high-quality database of homologous sequence alignments with good estimates of their corresponding phylogenetic trees will be a valuable resource to those studying phylogenetics. It will allow researchers to compare current and new models of sequence evolution across a large variety of sequences. The large quantity of data may provide inspiration for new models and methodology to study sequence evolution and may allow general statements about the relative effect of different molecular processes on evolution.

Results: The Pandit 7.6 database contains 4341 families of sequences derived from the seed alignments of the Pfam database of amino acid alignments of families of homologous protein domains (Bateman et al., 2002). Each family in Pandit includes an alignment of amino acid sequences that matches the corresponding Pfam family seed alignment, an alignment of DNA sequences that contain the coding sequence of the Pfam alignment when they can be recovered (overall, 82.9% of sequences taken from Pfam) and the alignment of amino acid sequences restricted to only those sequences for which a DNA sequence could be recovered. Each of the alignments has an estimate of the phylogenetic tree associated with it. The tree topologies were obtained using the neighbor joining method based on maximum likelihood estimates of the evolutionary distances, with branch lengths then calculated using a standard maximum likelihood approach.

Availability: The Pandit database is available for browsing and download via its home page at http://www.ebi.ac.uk/goldman-srv/pandit/

Contact: simon{at}ebi.ac.uk

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Nucleic Acids ResHome page
L. Barquist and I. Holmes
xREI: a phylo-grammar visualization webserver
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W65 - W69.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
C. Kosiol, I. Holmes, and N. Goldman
An Empirical Codon Model for Protein Sequence Evolution
Mol. Biol. Evol., July 1, 2007; 24(7): 1464 - 1479.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. Gough
Genomic scale sub-family assignment of protein domains
Nucleic Acids Res., July 28, 2006; 34(13): 3625 - 3633.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
N. Bortolussi, E. Durand, M. Blum, and O. Francois
apTreeshape: statistical analysis of phylogenetic tree shape
Bioinformatics, February 1, 2006; 22(3): 363 - 364.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
S. Whelan, P. I. W. de Bakker, E. Quevillon, N. Rodriguez, and N. Goldman
PANDIT: an evolution-centric database of protein and associated nucleotide domains with inferred trees
Nucleic Acids Res., January 1, 2006; 34(suppl_1): D327 - D331.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
V. Gopalan, W.-G. Qiu, M. Z. Chen, and A. Stoltzfus
Nexplorer: phylogeny-based exploration of sequence family data
Bioinformatics, January 1, 2006; 22(1): 120 - 121.
[Abstract] [Full Text] [PDF]


Home page
GeneticsHome page
T. Massingham and N. Goldman
Detecting Amino Acid Sites Under Positive Selection and Purifying Selection
Genetics, March 1, 2005; 169(3): 1753 - 1762.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
S. Aris-Brosou
Determinants of Adaptive Evolution at the Molecular Level: the Extended Complexity Hypothesis
Mol. Biol. Evol., February 1, 2005; 22(2): 200 - 209.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
C. Kosiol and N. Goldman
Different Versions of the Dayhoff Rate Matrix
Mol. Biol. Evol., February 1, 2005; 22(2): 193 - 199.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
M. Y. Galperin
The Molecular Biology Database Collection: 2005 update
Nucleic Acids Res., January 1, 2005; 33(suppl_1): D5 - D24.
[Abstract] [Full Text] [PDF]


Home page
GeneticsHome page
S. Whelan and N. Goldman
Estimating the Frequency of Events That Cause Multiple-Nucleotide Changes
Genetics, August 1, 2004; 167(4): 2027 - 2043.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.