# WARNING: this file is not sorted!
# db	id                         alt	consensus	 E-value	adj_p-value	log_adj_p-value	bin_location	bin_width	total_width	sites_in_bin	total_sites	p_success	 p-value	mult_tests
   1	GGGVCTCGAACCCNSR        MEME-1	GGGVCTCGAACCCNSR	1.8e-019	   2.4e-022	         -49.78	         0.0	      115	        485	         162	        324	  0.23711	1.0e-024	       242
   2	GGGTYCGA               DREME-1	GGGTYCGA	9.7e-027	   1.3e-029	         -66.50	         0.0	      107	        493	          98	        146	  0.21704	5.3e-032	       246
   2	GAACCCR                DREME-3	GAACCCR	3.7e-007	   5.1e-010	         -21.40	         0.0	      122	        494	          92	        191	  0.24696	2.1e-012	       246
   3	M1950_1.02             ZNF354C	GTGGAK	6.5e0000	   8.8e-003	          -4.74	         0.0	      223	        495	         316	        594	  0.45051	3.6e-005	       247
   3	M4569_1.02                HSF1	GTCSYGGGTTCGADTCCC	3.3e-005	   4.5e-008	         -16.92	         0.0	      105	        483	         112	        296	  0.21739	1.9e-010	       241
   3	M5974_1.02              ZNF524	GGGTTCRAGGGT	7.2e-004	   9.7e-007	         -13.84	         0.0	      111	        489	         160	        464	  0.22699	4.0e-009	       244
##
# Detailed descriptions of columns in this file:
#
# db:	The name of the database (file name) that contains the motif.
# id:	A name for the motif that is unique in the motif database file.
# alt:	An alternate name of the motif that may be provided
#	in the motif database file.
# consensus:	A consensus sequence computed from the motif.
# E-value:	The expected number motifs that would have least one.
#	region as enriched for best matches to the motif as the reported region.
#	The E-value is the p-value multiplied by the number of motifs in the
#	input database(s).
# adj_p-value:	The probability that any tested region would be as enriched for
#	best matches to this motif as the reported region is.
#	By default the p-value is calculated by using the one-tailed binomial
#	test on the number of sequences with a match to the motif 
#	that have their best match in the reported region, corrected for
#	the number of regions and score thresholds tested.
#	The test assumes that the probability that the best match in a sequence
#	falls in the region is the region width divided by the
#	number of places a motif
#	can align in the sequence (sequence length minus motif width plus 1).
#	When CentriMo is run in discriminative mode with a negative
#	set of sequences, the p-value of a region is calculated
#	using the Fisher exact test on the 
#	enrichment of best matches in the positive sequences relative
#	to the negative sequences, corrected
#	for the number of regions and score thresholds tested.
#	The test assumes that the probability that the best match (if any)
#	falls into a given region
#	is the same for all positive and negative sequences.
# log_adj_p-value:	Log of adjusted p-value.
# bin_location:	Location of the center of the most enriched region.
# bin_width:	The width (in sequence positions) of the most enriched region.
#	A best match to the motif is counted as being in the region if the
#	center of the motif falls in the region.
# total_width:	The window maximal size which can be reached for this motif:
#		rounded(sequence length - motif length +1)/2
# sites_in_bin:	The number of (positive) sequences whose best match to the motif
#	falls in the reported region.
#	Note: This number may be less than the number of
#	(positive) sequences that have a best match in the region.
#	The reason for this is that a sequence may have many matches that score
#	equally best.
#	If n matches have the best score in a sequence, 1/n is added to the
#	appropriate bin for each match.
# total_sites:	The number of sequences containing a match to the motif
#	above the score threshold.
# p_success:	The probability of falling in the enriched window:
#		bin width / total width
# p-value:	The uncorrected p-value before it gets adjusted to the
#	number of multiple tests to give the adjusted p-value.
# mult_tests:	This is the number of multiple tests (n) done for this motif.
#	It was used to correct the original p-value of a region for
#	multiple tests using the formula:
#		p' = 1 - (1-p)^n where p is the uncorrected p-value.
#	The number of multiple tests is the number of regions
#	considered times the number of score thresholds considered.
#	It depends on the motif length, sequence length, and the type of
#	optimizations being done (central enrichment, local enrichment,
#	score optimization).