# 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	ACACACACACACACACACACACACACAC MEME-1	ACACACACACACACACACACACACACAC	7.8e-012	   1.0e-014	         -32.20	         0.0	       89	        473	          97	        226	  0.18816	4.4e-017	       236
   1	GTGTGTGTGTGTGTGT        MEME-2	GTGTGTGTGTGTGTGT	9.3e-010	   1.2e-012	         -27.42	         0.0	      211	        485	         210	        323	  0.43505	5.1e-015	       242
   1	GTGTGTGTGTGT            MEME-4	GTGTGTGTGTGT	5.1e-009	   6.8e-012	         -25.72	         0.0	       95	        489	         113	        293	  0.19427	2.8e-014	       244
   1	ACACACACA               MEME-8	ACACACACA	1.1e-004	   1.5e-007	         -15.72	         0.0	      100	        492	         118	        341	  0.20325	6.1e-010	       245
   1	AGTCAGGGTGGAGYAGGTAATCRGAATGAGTCAGG MEME-10	AGTCAGGGTGGAGYAGGTAATCRGAATGAGTCAGG	6.7e-002	   8.9e-005	          -9.33	         0.0	       46	        466	           9	         12	  0.09871	3.8e-007	       232
   3	M5883_1.02               TBX20	TCACACSTTCACACCT	1.2e0000	   1.6e-003	          -6.44	         0.0	      101	        485	         109	        353	  0.20825	6.6e-006	       242
   3	M5981_1.02              ZSCAN4	TTTTCAGKGTGTGCA	4.6e-004	   6.1e-007	         -14.30	         0.0	      246	        486	         218	        326	  0.50617	2.5e-009	       242
   3	M6212_1.02               EPAS1	CMCACGYAYDCAC	2.0e0000	   2.6e-003	          -5.94	         0.0	       90	        488	         132	        503	  0.18443	1.1e-005	       243
##
# 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).