BLAST-EXPLORER helps you building datasets for phylogenetic analysis

被引:579
作者
Dereeper, Alexis [1 ]
Audic, Stephane [1 ]
Claverie, Jean-Michel [1 ]
Blanc, Guillaume [1 ]
机构
[1] Informat Genom & Struct CNRS, Inst Microbiol Mediterranee, IFR 88, UPR2589, F-13009 Marseille, France
来源
BMC EVOLUTIONARY BIOLOGY | 2010年 / 10卷
关键词
GENERATION; SEARCH;
D O I
10.1186/1471-2148-10-8
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: The right sampling of homologous sequences for phylogenetic or molecular evolution analyses is a crucial step, the quality of which can have a significant impact on the final interpretation of the study. There is no single way for constructing datasets suitable for phylogenetic analysis, because this task intimately depends on the scientific question we want to address, Moreover, database mining softwares such as BLAST which are routinely used for searching homologous sequences are not specifically optimized for this task. Results: To fill this gap, we designed BLAST-Explorer, an original and friendly web-based application that combines a BLAST search with a suite of tools that allows interactive, phylogenetic-oriented exploration of the BLAST results and flexible selection of homologous sequences among the BLAST hits. Once the selection of the BLAST hits is done using BLAST-Explorer, the corresponding sequence can be imported locally for external analysis or passed to the phylogenetic tree reconstruction pipelines available on the Phylogeny.fr platform. Conclusions: BLAST-Explorer provides a simple, intuitive and interactive graphical representation of the BLAST results and allows selection and retrieving of the BLAST hit sequences based a wide range of criterions. Although BLAST-Explorer primarily aims at helping the construction of sequence datasets for further phylogenetic study, it can also be used as a standard BLAST server with enriched output. BLAST-Explorer is available at http://www.phylogeny.fr
引用
收藏
页数:6
相关论文
共 11 条
[1]   Gapped BLAST and PSI-BLAST: a new generation of protein database search programs [J].
Altschul, SF ;
Madden, TL ;
Schaffer, AA ;
Zhang, JH ;
Zhang, Z ;
Miller, W ;
Lipman, DJ .
NUCLEIC ACIDS RESEARCH, 1997, 25 (17) :3389-3402
[2]   PhyloBLAST: facilitating phylogenetic analysis of BLAST results [J].
Brinkman, FSL ;
Wan, I ;
Hancock, REW ;
Rose, AM ;
Jones, SJ .
BIOINFORMATICS, 2001, 17 (04) :385-387
[3]   Assessing Performance of Orthology Detection Strategies Applied to Eukaryotic Genomes [J].
Chen, Feng ;
Mackey, Aaron J. ;
Vermunt, Jeroen K. ;
Roos, David S. .
PLOS ONE, 2007, 2 (04)
[4]   TreeDyn:: towards dynamic graphics and annotations for analyses of trees [J].
Chevenet, Francois ;
Brun, Christine ;
Banuls, Anne-Laure ;
Jacq, Bernard ;
Christen, Richard .
BMC BIOINFORMATICS, 2006, 7 (1)
[5]   Phylogeny.fr: robust phylogenetic analysis for the non-specialist [J].
Dereeper, A. ;
Guignon, V. ;
Blanc, G. ;
Audic, S. ;
Buffet, S. ;
Chevenet, F. ;
Dufayard, J. -F. ;
Guindon, S. ;
Lefort, V. ;
Lescot, M. ;
Claverie, J. -M. ;
Gascuel, O. .
NUCLEIC ACIDS RESEARCH, 2008, 36 :W465-W469
[6]   HaMStR: Profile hidden markov model based search for orthologs in ESTs [J].
Ebersberger, Ingo ;
Strauss, Sascha ;
von Haeseler, Arndt .
BMC EVOLUTIONARY BIOLOGY, 2009, 9
[7]   PhyloGenie: automated phylome generation and analysis [J].
Frickey, T ;
Lupas, AN .
NUCLEIC ACIDS RESEARCH, 2004, 32 (17) :5231-5238
[8]   PhyloGena - a user-friendly system for automated phylogenetic annotation of unknown sequences [J].
Hanekamp, Kristian ;
Bohnebeck, Uta ;
Beszteri, Bank ;
Valentin, Klaus .
BIOINFORMATICS, 2007, 23 (07) :793-801
[9]   OrthoSelect: a protocol for selecting orthologous groups in phylogenomics [J].
Schreiber, Fabian ;
Pick, Kerstin ;
Erpenbeck, Dirk ;
Woerheide, Gert ;
Morgenstern, Burkhard .
BMC BIOINFORMATICS, 2009, 10 :219
[10]   CLUSTAL-W - IMPROVING THE SENSITIVITY OF PROGRESSIVE MULTIPLE SEQUENCE ALIGNMENT THROUGH SEQUENCE WEIGHTING, POSITION-SPECIFIC GAP PENALTIES AND WEIGHT MATRIX CHOICE [J].
THOMPSON, JD ;
HIGGINS, DG ;
GIBSON, TJ .
NUCLEIC ACIDS RESEARCH, 1994, 22 (22) :4673-4680