Skip Navigation


Nucleic Acids Research Advance Access originally published online on November 27, 2006
Nucleic Acids Research 2007 35(Database issue):D888-D894; doi:10.1093/nar/gkl882
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (5860K) Freely available
Right arrow Screen PDF (1199K) Freely available
Right arrowOA All Versions of this Article:
35/suppl_1/D888    most recent
gkl882v1
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 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 Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Pavy, N.
Right arrow Articles by Retzel, E. F.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pavy, N.
Right arrow Articles by Retzel, E. F.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2007, Vol. 35, Database issue D888-D894
© 2006 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Articles

ForestTreeDB: a database dedicated to the mining of tree transcriptomes

Nathalie Pavy1,*, James J. Johnson1, John A. Crow1, Charles Paule1, Timothy Kunau1, John MacKay and Ernest F. Retzel2,3

1 Laval University, Centre de Recherche en Biologie Forestière Québec, Canada G1K 7P4 2 University of Minnesota, CCGB Minneapolis, MN, USA 3 University MN, AHC-Research Computing 426 Church Street SE, Minneapolis, MN 55455, USA

*To whom correspondence should be addressed at: Laval University, Centre de recherche en biologie forestière, Pavillon C.E. Marchand, Québec, Canada G1K 7P4. Tel: +1 418 656 2131; Fax: +1 418 656 793; Email: nathalie.pavy{at}rsvs.ulaval.ca

Received August 16, 2006. Revised October 10, 2006. Accepted October 11, 2006.

ForestTreeDB is intended as a resource that centralizes large-scale expressed sequence tag (EST) sequencing results from several tree species (http://foresttree.org/ftdb). It currently encompasses 344 878 quality sequences from 68 libraries, from diverse organs of conifer and hybrid poplar trees. It utilizes the Nimbus data model to provide a hosting system for multiple projects, and uses object-relational mapping APIs in Java and Perl for data accesses within an Oracle database designed to be scalable, maintainable and extendable. Transcriptome builds or unigene sets occupy the focal point of the system. Several of the five current species-specific unigenes were used to design microarrays and SNP resources. The ForestTreeDB web application provides the means for multiple combination database queries. It presents the user with a list of discrete queries to retrieve and download large EST datasets or sequences from precompiled unigene assemblies. Functional annotation assignment is not trivial in conifers which are distantly related to angiosperm model plants. Optimal annotations are achieved through database queries that integrate results from several procedures based open-source tools. ForestTreeDB aims to facilitate sequence mining of coherent annotations in multiple species to support comparative genomic approaches. We plan to continuously enrich ForestTreeDB with other resources through collaborations with other genomic projects.


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




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.