Database Commons a catalog of biological databases

Database Commons - DOOR

DOOR

Citations: 218

z-index 23.01

Short name DOOR
Full name Database of Prokaryotic Operons
Description DOOR, which contains computationally predicted operons of all the sequenced prokaryotic genomes, is a useful resource to many biologists working on bacteria and archaea.
URL http://csbl.bmb.uga.edu/DOOR/
Year founded 2009
Last update & version NA    v2.0
Availability Free to all users
University/Institution hosted University of Georgia
Address Computational Systems Biology Laboratory,Department of Biochemistry and Molecular Biology,and Institute of Bioinformatics,University of Georgia,Athens,GA 30602,USA
City Athens
Province/State GA
Country/Region United States
Contact name Ying Xu
Contact email xyn@bmb.uga.edu
Data type(s)
Major organism(s)
Keyword(s)
  • binding motif
  • computationally predicted operons
  • prokaryotic operons.
Publication(s)
  • DOOR 2.0: presenting operons and their functions through dynamic and integrated views. [PMID: 24214966]

    Xizeng Mao, Qin Ma, Chuan Zhou, Xin Chen, Hanyuan Zhang, Jincai Yang, Fenglou Mao, Wei Lai, Ying Xu
    Nucleic acids research 2014:42(Database issue)
    26 Citations (Google Scholar as of 2016-01-28)

    Abstract: We have recently developed a new version of the DOOR operon database, DOOR 2.0, which is available online at http://csbl.bmb.uga.edu/DOOR/ and will be updated on a regular basis. DOOR 2.0 contains genome-scale operons for 2072 prokaryotes with complete genomes, three times the number of genomes covered in the previous version published in 2009. DOOR 2.0 has a number of new features, compared with its previous version, including (i) more than 250,000 transcription units, experimentally validated or computationally predicted based on RNA-seq data, providing a dynamic functional view of the underlying operons; (ii) an integrated operon-centric data resource that provides not only operons for each covered genome but also their functional and regulatory information such as their cis-regulatory binding sites for transcription initiation and termination, gene expression levels estimated based on RNA-seq data and conservation information across multiple genomes; (iii) a high-performance web service for online operon prediction on user-provided genomic sequences; (iv) an intuitive genome browser to support visualization of user-selected data; and (v) a keyword-based Google-like search engine for finding the needed information intuitively and rapidly in this database.

  • DOOR: a database for prokaryotic operons. [PMID: 18988623]

    Fenglou Mao, Phuongan Dam, Jacky Chou, Victor Olman, Ying Xu
    Nucleic acids research 2009:37(Database issue)
    192 Citations (Google Scholar as of 2016-01-24)

    Abstract: We present a database DOOR (Database for prOkaryotic OpeRons) containing computationally predicted operons of all the sequenced prokaryotic genomes. All the operons in DOOR are predicted using our own prediction program, which was ranked to be the best among 14 operon prediction programs by a recent independent review. Currently, the DOOR database contains operons for 675 prokaryotic genomes, and supports a number of search capabilities to facilitate easy access and utilization of the information stored in it. (1) Querying the database: the database provides a search capability for a user to find desired operons and associated information through multiple querying methods. (2) Searching for similar operons: the database provides a search capability for a user to find operons that have similar composition and structure to a query operon. (3) Prediction of cis-regulatory motifs: the database provides a capability for motif identification in the promoter regions of a user-specified group of possibly coregulated operons, using motif-finding tools. (4) Operons for RNA genes: the database includes operons for RNA genes. (5) OperonWiki: the database provides a wiki page (OperonWiki) to facilitate interactions between users and the developer of the database. We believe that DOOR provides a useful resource to many biologists working on bacteria and archaea, which can be accessed at http://csbl1.bmb.uga.edu/OperonDB.

Community reviews

Data
quality & quantity
Content organization & presentation
System accessibility & reliability
Reviewed by

Word cloud (embeddable)

Database Commons - Word Cloud

Accessibility

Rate of accessibility:
HTTP status codeDate requested
200 OK2018-11-20
200 OK2018-11-16
200 OK2018-11-13
-1 Failed2018-11-09
-1 Failed2018-11-06
-1 Failed2018-11-02
-1 Failed2018-10-30
-1 Failed2018-10-26
-1 Failed2018-10-23
-1 Failed2018-10-19
-1 Failed2018-10-16
200 OK2018-10-12
200 OK2018-10-09
200 OK2018-10-05
200 OK2018-10-02
200 OK2018-09-28
200 OK2018-09-25
200 OK2018-09-21
200 OK2018-09-18
200 OK2018-09-14
200 OK2018-09-11
200 OK2018-09-07
200 OK2018-09-04
200 OK2018-08-31
200 OK2018-08-28
200 OK2018-08-24
200 OK2018-08-21
200 OK2018-08-17
200 OK2018-08-14
200 OK2018-08-10
200 OK2018-08-07
200 OK2018-08-03
200 OK2018-07-31
200 OK2018-07-27
200 OK2018-07-24
200 OK2018-07-20
200 OK2018-07-17
200 OK2018-07-13
200 OK2018-07-10
200 OK2018-07-06
200 OK2018-07-03
200 OK2018-06-29
-1 Failed2018-06-26
-1 Failed2018-06-22
-1 Failed2018-06-19
-1 Failed2018-06-15
200 OK2018-06-12
-1 Failed2018-06-08
200 OK2018-06-05
200 OK2018-06-01
200 OK2018-05-29
200 OK2018-05-25
200 OK2018-05-22
200 OK2018-05-18
200 OK2018-05-15
200 OK2018-05-11
200 OK2018-05-08
200 OK2018-05-04
200 OK2018-05-01
200 OK2018-04-27
200 OK2018-04-24
200 OK2018-04-20
200 OK2018-04-17
200 OK2018-04-13
200 OK2018-04-10
200 OK2018-04-06
200 OK2018-04-03
200 OK2018-02-27
200 OK2018-02-23
200 OK2018-02-20
200 OK2018-02-16
200 OK2018-02-13
200 OK2018-02-09
200 OK2018-02-06
200 OK2018-02-02
200 OK2018-01-30
200 OK2018-01-26
200 OK2018-01-23
200 OK2018-01-19
200 OK2018-01-16
200 OK2018-01-12
200 OK2018-01-09
200 OK2018-01-05
200 OK2018-01-02
200 OK2017-12-29
200 OK2017-12-26
200 OK2017-12-22
200 OK2017-12-19
200 OK2017-12-15
200 OK2017-12-12
200 OK2017-12-08
200 OK2017-12-05
200 OK2017-12-01
200 OK2017-11-28
200 OK2017-11-24
200 OK2017-11-21
200 OK2017-11-17
200 OK2017-11-14
200 OK2017-11-10
200 OK2017-11-07
200 OK2017-11-03
200 OK2017-10-31
200 OK2017-10-27
200 OK2017-10-24
200 OK2017-10-20
200 OK2017-10-17
200 OK2017-10-13
200 OK2017-10-10
200 OK2017-10-06
200 OK2017-10-03
200 OK2017-09-29
200 OK2017-09-26
200 OK2017-09-22
200 OK2017-09-19
200 OK2017-09-15
200 OK2017-09-12
200 OK2017-09-08
200 OK2017-09-05
200 OK2017-09-01
200 OK2017-08-29
200 OK2017-08-25
200 OK2017-08-22
200 OK2017-08-18
200 OK2017-08-15
200 OK2017-08-11
200 OK2017-08-08
200 OK2017-08-04
200 OK2017-08-01
200 OK2017-07-28
200 OK2017-07-25
200 OK2017-07-21
200 OK2017-07-18
200 OK2017-07-14
200 OK2017-07-04
200 OK2017-06-30
200 OK2017-06-27
200 OK2017-06-23
200 OK2017-06-20
200 OK2017-06-16
200 OK2017-06-13
200 OK2017-06-09
200 OK2017-06-06
200 OK2017-06-02
200 OK2017-05-30
200 OK2017-05-26
200 OK2017-05-23
200 OK2017-05-19
200 OK2017-05-16
200 OK2017-05-12
200 OK2017-05-09
200 OK2017-05-05
200 OK2017-05-02
200 OK2017-04-28
200 OK2017-04-25
200 OK2017-04-21
200 OK2017-04-18
200 OK2017-04-14
200 OK2017-04-11
200 OK2017-04-07
200 OK2017-04-04
200 OK2017-03-31
200 OK2017-03-28
200 OK2017-03-24
200 OK2017-03-21
200 OK2017-03-17
200 OK2017-03-14
200 OK2017-03-10
200 OK2017-03-07
200 OK2017-03-03
200 OK2017-02-28
200 OK2017-02-24
200 OK2017-02-21
200 OK2017-02-17
200 OK2017-02-14
200 OK2017-02-10
200 OK2017-02-07
200 OK2017-02-03
200 OK2017-01-31
200 OK2017-01-27
200 OK2017-01-24
200 OK2017-01-20
200 OK2017-01-17
200 OK2017-01-13
200 OK2017-01-10
200 OK2017-01-06
200 OK2017-01-03
200 OK2016-12-30
200 OK2016-12-27
200 OK2016-12-23
200 OK2016-12-20
200 OK2016-12-16
200 OK2016-12-13
200 OK2016-12-09
200 OK2016-12-06
200 OK2016-12-02
200 OK2016-11-29
200 OK2016-11-25
200 OK2016-11-22
200 OK2016-11-18
200 OK2016-11-15
-1 Failed2016-11-11
200 OK2016-11-08
200 OK2016-11-04
200 OK2016-11-01
200 OK2016-10-28
200 OK2016-10-25
200 OK2016-10-21
200 OK2016-10-18
200 OK2016-10-14
200 OK2016-10-11
200 OK2016-10-07
200 OK2016-10-04
200 OK2016-09-30
200 OK2016-09-27
200 OK2016-09-23
200 OK2016-09-20
200 OK2016-09-16
200 OK2016-09-13
200 OK2016-09-09
200 OK2016-09-06
200 OK2016-09-02
200 OK2016-08-30
200 OK2016-08-26
200 OK2016-08-23
200 OK2016-08-19
200 OK2016-08-16
200 OK2016-08-12
200 OK2016-08-09
200 OK2016-08-05
200 OK2016-08-02
200 OK2016-07-29
200 OK2016-07-26
-1 Failed2016-07-22
200 OK2016-07-19
200 OK2016-07-15
200 OK2016-07-12
200 OK2016-07-08
200 OK2016-07-05
200 OK2016-07-01
200 OK2016-06-28
200 OK2016-06-24
200 OK2016-06-21
200 OK2016-06-17
200 OK2016-06-14
200 OK2016-06-10
200 OK2016-06-07
200 OK2016-06-03
200 OK2016-05-31
200 OK2016-05-27
200 OK2016-05-24
200 OK2016-05-20
200 OK2016-05-17
200 OK2016-05-13
200 OK2016-05-10
200 OK2016-05-06
200 OK2016-05-03
200 OK2016-04-29
200 OK2016-04-26
200 OK2016-04-22
200 OK2016-04-19
200 OK2016-04-15
200 OK2016-04-12
200 OK2016-04-08
200 OK2016-04-05
200 OK2016-04-01
200 OK2016-03-29
200 OK2016-03-28
200 OK2016-03-25
200 OK2016-03-23
200 OK2016-03-21
200 OK2016-03-18
200 OK2016-03-16
200 OK2016-03-14
200 OK2016-03-11
200 OK2016-03-09
200 OK2016-03-07
200 OK2016-03-04
200 OK2016-03-02
200 OK2016-02-29
200 OK2016-02-26
200 OK2016-02-24
200 OK2016-02-22
200 OK2016-02-19
200 OK2016-02-17
200 OK2016-02-15
200 OK2016-02-14
200 OK2016-02-12
200 OK2016-02-10
200 OK2016-02-08
200 OK2016-02-07
200 OK2016-02-05
200 OK2016-02-03
200 OK2016-02-01
200 OK2016-01-31
200 OK2016-01-29
200 OK2016-01-27
200 OK2016-01-25
200 OK2016-01-24
200 OK2016-01-22
200 OK2016-01-20
200 OK2016-01-18
200 OK2016-01-17
200 OK2016-01-15
200 OK2016-01-13
200 OK2016-01-11
200 OK2016-01-10
200 OK2016-01-08
200 OK2016-01-06
200 OK2016-01-04

Tags

DNA
Prokaryote
binding motif computationally predicted operons prokaryotic operons.

Record metadata

  • Created on: 2015-06-20
  • Curated by:
    • Jian Sang [2016-04-04]
    • Jian Sang [2015-12-07]
    • Jian Sang [2015-06-26]
Stats