Database Commons a catalog of biological databases

Database Commons - Dfam

Dfam

Citations: 58

z-index 8.93

Short name Dfam
Full name Dfam
Description The Dfam database is a collection of Repetitive DNA element sequence alignments,hidden Markov models (HMMs) and matches lists for complete Eukaryote genomes.
URL http://dfam.janelia.org/
Year founded 2012
Last update & version 2015-09-01    v2.0
Availability Free to all users
University/Institution hosted University of Montana, Missoula
Address University of Montana, Missoula, MT 59812, USA
City Missoula
Province/State
Country/Region United States
Contact name Travis J. Wheeler
Contact email travis.wheeler@umontana.edu
Data type(s)
Major organism(s)
Keyword(s)
  • hidden Markov models (HMMs)
  • repetitive dna element
Publication(s)
  • The Dfam database of repetitive DNA families. [PMID: 26612867]

    Robert Hubley, Robert D Finn, Jody Clements, Sean R Eddy, Thomas A Jones, Weidong Bao, Arian F A Smit, Travis J Wheeler
    Nucleic acids research 2016:44(D1)
    Citation (to be updated)

    Abstract: Repetitive DNA, especially that due to transposable elements (TEs), makes up a large fraction of many genomes. Dfam is an open access database of families of repetitive DNA elements, in which each family is represented by a multiple sequence alignment and a profile hidden Markov model (HMM). The initial release of Dfam, featured in the 2013 NAR Database Issue, contained 1143 families of repetitive elements found in humans, and was used to produce more than 100 Mb of additional annotation of TE-derived regions in the human genome, with improved speed. Here, we describe recent advances, most notably expansion to 4150 total families including a comprehensive set of known repeat families from four new organisms (mouse, zebrafish, fly and nematode). We describe improvements to coverage, and to our methods for identifying and reducing false annotation. We also describe updates to the website interface. The Dfam website has moved to http://dfam.org. Seed alignments, profile HMMs, hit lists and other underlying data are available for download. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

  • Dfam: a database of repetitive DNA based on profile hidden Markov models. [PMID: 23203985]

    Travis J Wheeler, Jody Clements, Sean R Eddy, Robert Hubley, Thomas A Jones, Jerzy Jurka, Arian F A Smit, Robert D Finn
    Nucleic acids research 2013:41(Database issue)
    58 Citations (Google Scholar as of 2016-05-01)

    Abstract: We present a database of repetitive DNA elements, called Dfam (http://dfam.janelia.org). Many genomes contain a large fraction of repetitive DNA, much of which is made up of remnants of transposable elements (TEs). Accurate annotation of TEs enables research into their biology and can shed light on the evolutionary processes that shape genomes. Identification and masking of TEs can also greatly simplify many downstream genome annotation and sequence analysis tasks. The commonly used TE annotation tools RepeatMasker and Censor depend on sequence homology search tools such as cross_match and BLAST variants, as well as Repbase, a collection of known TE families each represented by a single consensus sequence. Dfam contains entries corresponding to all Repbase TE entries for which instances have been found in the human genome. Each Dfam entry is represented by a profile hidden Markov model, built from alignments generated using RepeatMasker and Repbase. When used in conjunction with the hidden Markov model search tool nhmmer, Dfam produces a 2.9% increase in coverage over consensus sequence search methods on a large human benchmark, while maintaining low false discovery rates, and coverage of the full human genome is 54.5%. The website provides a collection of tools and data views to support improved TE curation and annotation efforts. Dfam is also available for download in flat file format or in the form of MySQL table dumps.

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
200 OK2018-11-09
200 OK2018-11-06
200 OK2018-11-02
200 OK2018-10-30
200 OK2018-10-26
200 OK2018-10-23
200 OK2018-10-19
200 OK2018-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
200 OK2018-06-26
200 OK2018-06-22
200 OK2018-06-19
200 OK2018-06-15
200 OK2018-06-12
200 OK2018-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
-1 Failed2017-04-25
-1 Failed2017-04-21
-1 Failed2017-04-18
-1 Failed2017-04-14
-1 Failed2017-04-11
-1 Failed2017-04-07
-1 Failed2017-04-04
-1 Failed2017-03-31
-1 Failed2017-03-28
-1 Failed2017-03-24
-1 Failed2017-03-21
-1 Failed2017-03-17
-1 Failed2017-03-14
-1 Failed2017-03-10
-1 Failed2017-03-07
-1 Failed2017-03-03
-1 Failed2017-02-28
-1 Failed2017-02-24
-1 Failed2017-02-21
-1 Failed2017-02-17
-1 Failed2017-02-14
-1 Failed2017-02-10
-1 Failed2017-02-07
-1 Failed2017-02-03
-1 Failed2017-01-31
-1 Failed2017-01-27
-1 Failed2017-01-24
-1 Failed2017-01-20
-1 Failed2017-01-17
-1 Failed2017-01-13
-1 Failed2017-01-10
-1 Failed2017-01-06
-1 Failed2017-01-03
-1 Failed2016-12-30
-1 Failed2016-12-27
-1 Failed2016-12-23
-1 Failed2016-12-20
-1 Failed2016-12-16
-1 Failed2016-12-13
-1 Failed2016-12-09
-1 Failed2016-12-06
-1 Failed2016-12-02
-1 Failed2016-11-29
-1 Failed2016-11-25
-1 Failed2016-11-22
-1 Failed2016-11-18
-1 Failed2016-11-15
-1 Failed2016-11-11
-1 Failed2016-11-08
-1 Failed2016-11-04
-1 Failed2016-11-01
-1 Failed2016-10-28
-1 Failed2016-10-25
-1 Failed2016-10-21
-1 Failed2016-10-18
-1 Failed2016-10-14
-1 Failed2016-10-11
-1 Failed2016-10-07
-1 Failed2016-10-04
-1 Failed2016-09-30
-1 Failed2016-09-27
-1 Failed2016-09-23
-1 Failed2016-09-20
-1 Failed2016-09-16
-1 Failed2016-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
200 OK2016-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
-1 Failed2016-03-25
200 OK2016-03-23
200 OK2016-03-21
200 OK2016-03-18
-1 Failed2016-03-16
200 OK2016-03-14
200 OK2016-03-11
200 OK2016-03-09
-1 Failed2016-03-07
200 OK2016-03-04
200 OK2016-03-02
-1 Failed2016-02-29
200 OK2016-02-26
200 OK2016-02-24
-1 Failed2016-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
Eukaryota
hidden Markov models (HMMs) repetitive dna element

Record metadata

  • Created on: 2015-06-20
  • Curated by:
    • Lina Ma [2016-08-16]
    • Jian Sang [2016-04-04]
    • Lin Liu [2016-01-03]
    • Lin Liu [2016-01-01]
    • Jian Sang [2015-12-07]
    • Jian Sang [2015-06-26]
Stats