# 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	SCCTCCC                 MEME-1	SCCTCCC	1.9e0000	   2.5e-003	          -5.97	         0.0	      310	        494	         411	        577	  0.62753	1.0e-005	       246
   2	CYTCCY                 DREME-1	CCTCCC	1.8e0000	   2.5e-003	          -6.01	         0.0	      311	        495	         422	        593	  0.62828	1.0e-005	       247
   2	GACCCCW                DREME-2	GACCCCW	1.1e-001	   1.5e-004	          -8.82	         0.0	       78	        494	          55	        182	  0.15789	6.0e-007	       246
   3	M0422_1.02 (ZIC5)_(Mus_musculus)_(DBD_0.99)	SYRGGGGGTM	2.3e-008	   3.2e-011	         -24.18	         0.0	      181	        491	         309	        599	  0.36864	1.3e-013	       245
   3	M4612_1.02               CTCFL	CCRSCAGGGGGCGCY	8.8e-006	   1.2e-008	         -18.24	         0.0	      198	        486	         305	        560	  0.40741	4.9e-011	       242
   3	M4640_1.02              ZBTB7A	GGGSRRGGGKCBSBG	3.5e-001	   4.7e-004	          -7.66	         0.0	       98	        486	         169	        600	  0.20165	1.9e-006	       242
   3	M5490_1.02               GLIS1	GCDTCGTGGGGGGTCK	2.4e-003	   3.3e-006	         -12.62	         0.0	      129	        485	          77	        163	  0.26598	1.4e-008	       242
   3	M5491_1.02               GLIS2	CDYYGCGGGGGGTC	3.4e-013	   4.6e-016	         -35.31	         0.0	      121	        487	         222	        526	  0.24846	1.9e-018	       243
   3	M5965_1.02                ZIC4	DCDCMGCGGGGGGYC	1.2e-013	   1.6e-016	         -36.37	         0.0	      128	        486	         251	        578	  0.26337	6.6e-019	       242
   3	M5977_1.02              ZNF740	GTGGGGGGGK	2.5e-001	   3.4e-004	          -7.98	         0.0	      285	        491	         394	        583	  0.58045	1.4e-006	       245
   3	M6267_1.02               GLIS3	GYGGGGGGTM	4.4e-012	   5.9e-015	         -32.76	         0.0	      125	        491	         246	        594	  0.25458	2.4e-017	       245
   3	M6275_1.02               HIF1A	SBSTACGTGCSB	6.1e0000	   8.2e-003	          -4.80	         0.0	      281	        489	         332	        501	  0.57464	3.4e-005	       244
   3	M6326_1.02                KLF8	CMGGGKGTG	3.1e-001	   4.2e-004	          -7.79	         0.0	      198	        492	         289	        580	  0.40244	1.7e-006	       245
   3	M6422_1.02              PLAGL1	CRGGGGGCCC	2.0e-017	   2.7e-020	         -45.08	         0.0	      145	        491	         287	        590	  0.29532	1.1e-022	       245
   3	M6548_1.02                ZIC1	KGGGWGGTS	1.5e-004	   2.1e-007	         -15.38	         0.0	      270	        492	         402	        599	  0.54878	8.5e-010	       245
   3	M6549_1.02                ZIC2	KGGGTGGTC	1.2e0000	   1.7e-003	          -6.39	         0.0	      176	        492	         266	        598	  0.35772	6.9e-006	       245
   3	M6550_1.02                ZIC3	BGGGTGGYC	2.0e0000	   2.7e-003	          -5.93	         0.0	      174	        492	         262	        597	  0.35366	1.1e-005	       245
##
# 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).