Minimac - Revision history

Santy.8128 at 16:53, 9 March 2018

2018-03-09T16:53:43Z

← Older revision		Revision as of 12:53, 9 March 2018
Line 1:		Line 1:
	'''You may want to learn about new and improved [[~~Minimac3~~]].'''		'''You may want to learn about new and improved [[Minimac4]].'''

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Pjvh at 19:29, 1 March 2017

2017-03-01T19:29:49Z

← Older revision		Revision as of 15:29, 1 March 2017
Line 1:		Line 1:
	'''~~This page is about the original version of Minimac.~~ You may want to learn about new and improved [[Minimac3]].'''		'''You may want to learn about new and improved [[Minimac3]].'''

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Pjvh at 19:29, 1 March 2017

2017-03-01T19:29:09Z

← Older revision		Revision as of 15:29, 1 March 2017
Line 1:		Line 1:
	'''This page is about the original version of Minimac. You may want to learn about new and improved [[Minimac3]]'''		'''This page is about the original version of Minimac. You may want to learn about new and improved [[Minimac3]].'''

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Pjvh at 19:28, 1 March 2017

2017-03-01T19:28:54Z

← Older revision		Revision as of 15:28, 1 March 2017
Line 1:		Line 1:
	'''You may want to learn about new and improved [[Minimac3]]'''		'''This page is about the original version of Minimac. You may want to learn about new and improved [[Minimac3]]'''

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Mflick at 19:24, 1 March 2017

2017-03-01T19:24:32Z

← Older revision		Revision as of 15:24, 1 March 2017
Line 1:		Line 1:
	'''~~New Version~~ [[Minimac3]] ~~available ! Please Check out !!!~~'''		'''You may want to learn about new and improved [[Minimac3]]'''

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Mflick at 19:23, 1 March 2017

2017-03-01T19:23:30Z

← Older revision		Revision as of 15:23, 1 March 2017
Line 1:		Line 1:
	'''New Version [[Minimac3]] available ! Please Check out !!!'''		'''New Version [[Minimac3]] available ! Please Check out !!!'''

	~~Please check out [[minimac2]]!~~

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Santy.8128 at 05:03, 31 January 2015

2015-01-31T05:03:05Z

← Older revision		Revision as of 01:03, 31 January 2015
Line 1:		Line 1:
			'''New Version [[Minimac3]] available ! Please Check out !!!'''

	Please check out [[minimac2]]!		Please check out [[minimac2]]!

Cfuchsb at 07:42, 28 January 2015

2015-01-28T07:42:43Z

← Older revision		Revision as of 03:42, 28 January 2015
Line 1:		Line 1:
	Please check out [[minimac2]]~~. [[minimac2]] is an improved version of Minimac.~~		Please check out [[minimac2]]!

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Cfuchsb at 07:42, 28 January 2015

2015-01-28T07:42:30Z

← Older revision		Revision as of 03:42, 28 January 2015
Line 1:		Line 1:
			Please check out [[minimac2]]. [[minimac2]] is an improved version of Minimac.

	'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.		'''minimac''' is a low memory, computationally efficient implementation of the MaCH algorithm for genotype imputation. It is designed to work on phased genotypes and can handle very large reference panels with hundreds or thousands of haplotypes. The name has two parts. The first, "mini", refers to the modest amount of computational resources it requires. The second, "mac", is short hand for [[MaCH]], our widely used algorithm for genotype imputation.

Cfuchsb at 07:38, 28 January 2015

2015-01-28T07:38:00Z

← Older revision		Revision as of 03:38, 28 January 2015
Line 14:		Line 14:

	= Download =		= Download =
	A binary Linux (64 bit) version of minimac is available [http://~~www~~.sph.umich.edu~~/csg~~/cfuchsb/minimac-beta-2013.7.17.tgz from here] and source code [http://~~www~~.sph.umich.edu~~/csg~~/cfuchsb/minimac.src.tgz from here]		A binary Linux (64 bit) version of minimac is available [http://csg.sph.umich.edu/cfuchsb/minimac-beta-2013.7.17.tgz from here] and source code [http://csg.sph.umich.edu/cfuchsb/minimac.src.tgz from here]

	The current version of minimac should be stamped 2013.7.17 - if your version shows a different version number or date stamp when it runs, it is not current.		The current version of minimac should be stamped 2013.7.17 - if your version shows a different version number or date stamp when it runs, it is not current.
Line 126:		Line 126:
	=== Preparing Your Data ===		=== Preparing Your Data ===

	To get started, you will need to store your data in [[Merlin]] format pedigree and data files, one per chromosome. For details, of the Merlin file format, see the [http://~~www~~.sph.umich.edu~~/csg~~/abecasis/Merlin/tour/input_files.html Merlin Tutorial].		To get started, you will need to store your data in [[Merlin]] format pedigree and data files, one per chromosome. For details, of the Merlin file format, see the [http://csg.sph.umich.edu/abecasis/Merlin/tour/input_files.html Merlin Tutorial].

	Within each file, markers should be stored by chromosome position. Alleles should be stored in the forward strand and can be encoded as 'A', 'C', 'G' or 'T' (there is no need to use numeric identifiers for each allele).		Within each file, markers should be stored by chromosome position. Alleles should be stored in the forward strand and can be encoded as 'A', 'C', 'G' or 'T' (there is no need to use numeric identifiers for each allele).
Line 152:		Line 152:
	\|-		\|-
	\|style=white-space:nowrap\|<code>-d sample.dat</code>		\|style=white-space:nowrap\|<code>-d sample.dat</code>
	\| Data file in [http://~~www~~.sph.umich.edu~~/csg~~/abecasis/Merlin/tour/input_files.html Merlin format]. Markers should be listed according to their order along the chromosome.		\| Data file in [http://csg.sph.umich.edu/abecasis/Merlin/tour/input_files.html Merlin format]. Markers should be listed according to their order along the chromosome.
	\|-		\|-
	\| <code>-p sample.ped</code>		\| <code>-p sample.ped</code>
	\| Pedigree file in [http://~~www~~.sph.umich.edu~~/csg~~/abecasis/Merlin/tour/input_files.html Merlin format]. Alleles should be labeled on the forward strand.		\| Pedigree file in [http://csg.sph.umich.edu/abecasis/Merlin/tour/input_files.html Merlin format]. Alleles should be labeled on the forward strand.
	\|-		\|-
	\| <code>--states 200</code>		\| <code>--states 200</code>
Line 210:		Line 210:
	\|-		\|-
	\| <code>--refHaps ref.hap.gz </code>		\| <code>--refHaps ref.hap.gz </code>
	\| Reference haplotypes (e.g. from [http://~~www~~.sph.umich.edu~~/csg~~/abecasis/MACH/download/ MaCH download page])		\| Reference haplotypes (e.g. from [http://csg.sph.umich.edu/abecasis/MACH/download/ MaCH download page])
	\|-		\|-
	\| <code>--vcfReference </code>		\| <code>--vcfReference </code>
Line 245:		Line 245:
	=== Reference Haplotypes ===		=== Reference Haplotypes ===

	Reference haplotypes generated by the 1000 Genomes project and formatted so that they are ready for analysis are available from the [http://~~www~~.sph.umich.edu~~/csg~~/abecasis/MACH/download/ MaCH download page]. As of this writing, the most recent set of haplotypes are based on genotype calls were generated in May 2011 and are an interim analysis of Project's Phase I data.		Reference haplotypes generated by the 1000 Genomes project and formatted so that they are ready for analysis are available from the [http://csg.sph.umich.edu/abecasis/MACH/download/ MaCH download page]. As of this writing, the most recent set of haplotypes are based on genotype calls were generated in May 2011 and are an interim analysis of Project's Phase I data.

	=== Imputation quality evaluation ===		=== Imputation quality evaluation ===
Line 290:		Line 290:
	= Post-imputation Association Analysis =		= Post-imputation Association Analysis =
	== Quantitative Traits ==		== Quantitative Traits ==
	Please use [http://~~www~~.sph.umich.edu~~/csg~~/yli/mach/download/mach2qtl.source.V108.tgz mach2qtl].		Please use [http://csg.sph.umich.edu/yli/mach/download/mach2qtl.source.V108.tgz mach2qtl].

	== Binary Traits ==		== Binary Traits ==
	Please use [http://~~www~~.sph.umich.edu~~/csg~~/yli/mach/download/mach2dat.source.1.0.18.tgz mach2dat]. Versions 1.0.18 and above accommodate to minimac output.		Please use [http://csg.sph.umich.edu/yli/mach/download/mach2dat.source.1.0.18.tgz mach2dat]. Versions 1.0.18 and above accommodate to minimac output.

	= Reference =		= Reference =