Effective Recombination in Plant Breeding and Linkage Mapping Populations: Testing Models and Mating Schemes

Size: px
Start display at page:

Download "Effective Recombination in Plant Breeding and Linkage Mapping Populations: Testing Models and Mating Schemes"

Transcription

1 Effective Recombination in Plant Breeding and Linkage Mapping Populations: Testing Models and Mating Schemes Raven et al., 1999 Seth C. Murray Assistant Professor of Quantitative Genetics and Maize Breeding Texas A&M University / Texas AgriLife Research

2 We Tend to Envision Recombination as Presented in Introductory Textbooks - Recombining the genetic material of two parents - Occurs in meiotic prophase I - Crossing over was described and modeled in: Muller H.J., 1916 The mechanism of crossing over, Am. Nat. 50: From: Raven, P.H., R.F. Evert and S.E. Eichhorn Biology of Plants; sixth ed., Freeman/Worth, New York From: Fairbanks, D. J., W. R. Andersen 1999 Genetics: the continuity of life. Brooks/Cole and Wadsworth, Pacific Grove, California, USA

3 Effective Recombination in an F 6 RIL Population Adding double crossovers Effective recombination can directly be observed through rearrangement of polymorphic marker genotypes and always less than the actual and expected number of recombination events

4 In Plant Breeding and Genetic Linkage Mapping Effective Recombination is Often the Limiting Factor INDIVIDUAL 1 INDIVIDUAL 2 INDIVIDUAL 3 INDIVIDUAL 4 INDIVIDUAL 5 INDIVIDUAL 6 INDIVIDUAL 7 INDIVIDUAL 8 INDIVIDUAL 9 Introgression of an exotic disease resistance gene we would still expect linkage drag. Potentially hundreds of genes within this linkage block, not near gene resolution for map based cloning - Few markers across a chromosome do not capture all events - With next generation sequencing technology we will soon capture all events - No perceived drawbacks with more recombination Agro 643 QTL Mapping Composite Interval Mapping

5 1) What are the minimum numbers of loci that must be simulated for sufficient likelihood of capturing all possible recombination? 2) Can textbook or alternative statistical distributions adequately model recombination in the high resolution Zea mays L. NAM dataset? 3) What proportion of effective recombination events in linkage populations might be missed due to insufficient and imperfect marker coverage? 4) What are the distributions of effective number of recombination events per chromosome that are expected to occur under common linkage population scenarios? 5) What is the relationship between heterozygosity and effective recombination?

6 How Do We Simulate Recombination and Linkage? Beads on a String Model : Locus 1 Locus 2 Locus 3 Locus 4 Locus 5 Locus 6 Locus 7 Locus 8 Parent 1 Parent 2 r r r r r r r F1 Locus Allele Allele C LCrossover<- ceiling(runif(1,0,loci/2)) RCrossover<- ceiling(runif(1,loci/2,loci)) 2 5 Example = Example =

7 Minimum Number of Markers Needed to Simulate Population Recombination Counting recombination events NOT distance (cm) Biparental cross selfed for 8 generations to RILs Dihybrid cross 3 generations of sibing 8 generations of selfing to RILs

8 Mean number of effective recombination events captured = β - (((log (loci+ β)) - (log (loci))) / χ ) Biparental cross selfed for 8 generations to RILs Dihybrid cross 3 generations of sibing 8 generations of selfing to RILs

9 - 25 F 6 Populations RILS SNPs - 136,000 recombination events

10 Parental (F 1 ) genotype before crossing over in prophase I A A A A A A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B B B B B B B B B B B A) Two strand double crossover model A A A A A A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B X B B B B B B B B B B B B B A A A A A A A A A A A A B B B B B B B B B B B B B A A A A A A A A A A A A X A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B B B B B B B B B B B B) Four strand quadruple crossover model Simulated Recombination events } 2 0 A A A A A B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B X B B B B B B B B B B B B B A A A A A A A A A A A A B B B B B B B B B B B B B A A A A A A A A A A A A X A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A B B B B B B B B B B C) Stochastic crossover model A A A A A A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B X B B B B B B B B B B B B B A A A A A A A A A A A A B B B B B B B B B B B B B A A A A A A A A A A A A X A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B A A A A A A A A A A A A A A A A A A A A X A A A A A A A A A A A A A A A B B B A A A A A A A A A A A A B B B B B B B B B B B B B B B B B B B B X B B B B B B B B B B B B B B B A A A B B B B B B B A A A A A A A A A A B B B B B B B B B B B B A A A X A A A A A A B B B B B B B B B B B B A A A A A A A B B B B B B B B B B A A A A A A A A A A A A B B B X B B B B B B A A A A A A A A A A A A B B B B B B B } 2 } 0 } 1 } 2 } 3 } 4 2

11 Fixed: four-strand quadruple crossover model Fixed: two-strand double crossover model Actual NAM data Stochastic: twostrand Poisson distributed (λ=3) model Stochastic: fourstrand geometric distributed (p =0.45) crossover model

12 Stochastic Poisson + Obligate Crossover Fit NAM Data Well MUST Develop Separate Rate for Each Chromosome Chromosome 1: NAM sample μ = 5.73 NAM sample σ = 8.73 Sim. Poisson λ = 2.24 Fit Chi-sq. = p > 0.001** Chromosome 9: NAM sample μ = 2.90 NAM sample σ = 3.87 Sim. Poisson λ = 0.90 Fit Chi-sq. = p > 0.78

13 Predicted Effect of Incomplete Marker Data in NAM With 84 polymorphic markers per chromosome we expect to detect 3.56 events (3.58 empirical) With 1004 polymorphic markers per chromosome we expect to detect 4.06 events (empirical: Stay Tuned)

14 Predicted Distributions of Effective Recombination Events Under Different Population Development Scenarios μ = 1.83 μ = 3.57 μ = 5.41 σ = 1.86 σ = 4.83 σ = 6.58 Event / gen. = 0.92 Event / gen. = 0.45 Event / gen. = 0.60 μ = 5.41 σ = 6.58 Event / gen. = 0.60 μ = 9.68 σ = E./ g. = 0.81 μ = 12.7 σ = E./ g. = 1.06

15 Direct Relationship Between Heterozygosity and the Effective Number of Events (Crossovers * Mean Genomewide Heterozygosity) + Previous Events

16 1) A minimum of 200 loci must be simulated to capture most effective recombination events in experimental populations (more are preferable). 2) Only a (stochastic Poisson + obligate) number of crossovers fits the high resolution Zea mays L. NAM dataset, not a textbook fixed number. 3) Insufficient and imperfect marker coverage is expected to miss 0.5 effective recombination events / chromosome / individual (~12%) in NAM. 4) The highest number of effective recombination events per generation is expected to be found in dihybrid populations > F 2 > doubled haploids F 1 > RILs. Intermating early always produces more recombination. 5) Average effective recombination per generation is equal to the recombination rate * average genomewide heterozygosity. - Thanks to SCSC 653 class of 2009 for asking good questions - Thanks to Jeffrey Glaubitz and Michael McMullen for updating a NAM file. - Conversations on an early work with: Mattieu Falque, Wojtek Pawlowski, Michael Gore, Jianming Yu, Mark Wright and Sean Miles, George Hodnett, Martha Hamblin and Randall Wisser. Funding for this project was provided by:

Lecture 7 QTL Mapping

Lecture 7 QTL Mapping Lecture 7 QTL Mapping Lucia Gutierrez lecture notes Tucson Winter Institute. 1 Problem QUANTITATIVE TRAIT: Phenotypic traits of poligenic effect (coded by many genes with usually small effect each one)

More information

Overview. Background. Locating quantitative trait loci (QTL)

Overview. Background. Locating quantitative trait loci (QTL) Overview Implementation of robust methods for locating quantitative trait loci in R Introduction to QTL mapping Andreas Baierl and Andreas Futschik Institute of Statistics and Decision Support Systems

More information

The Lander-Green Algorithm in Practice. Biostatistics 666

The Lander-Green Algorithm in Practice. Biostatistics 666 The Lander-Green Algorithm in Practice Biostatistics 666 Last Lecture: Lander-Green Algorithm More general definition for I, the "IBD vector" Probability of genotypes given IBD vector Transition probabilities

More information

PROC QTL A SAS PROCEDURE FOR MAPPING QUANTITATIVE TRAIT LOCI (QTLS)

PROC QTL A SAS PROCEDURE FOR MAPPING QUANTITATIVE TRAIT LOCI (QTLS) A SAS PROCEDURE FOR MAPPING QUANTITATIVE TRAIT LOCI (QTLS) S.V. Amitha Charu Rama Mithra NRCPB, Pusa campus New Delhi - 110 012 mithra.sevanthi@rediffmail.com Genes that control the genetic variation of

More information

Notes on QTL Cartographer

Notes on QTL Cartographer Notes on QTL Cartographer Introduction QTL Cartographer is a suite of programs for mapping quantitative trait loci (QTLs) onto a genetic linkage map. The programs use linear regression, interval mapping

More information

Haplotype Analysis. 02 November 2003 Mendel Short IGES Slide 1

Haplotype Analysis. 02 November 2003 Mendel Short IGES Slide 1 Haplotype Analysis Specifies the genetic information descending through a pedigree Useful visualization of the gene flow through a pedigree A haplotype for a given individual and set of loci is defined

More information

Development of linkage map using Mapmaker/Exp3.0

Development of linkage map using Mapmaker/Exp3.0 Development of linkage map using Mapmaker/Exp3.0 Balram Marathi 1, A. K. Singh 2, Rajender Parsad 3 and V.K. Gupta 3 1 Institute of Biotechnology, Acharya N. G. Ranga Agricultural University, Rajendranagar,

More information

Network Based Models For Analysis of SNPs Yalta Opt

Network Based Models For Analysis of SNPs Yalta Opt Outline Network Based Models For Analysis of Yalta Optimization Conference 2010 Network Science Zeynep Ertem*, Sergiy Butenko*, Clare Gill** *Department of Industrial and Systems Engineering, **Department

More information

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland Genetic Programming Charles Chilaka Department of Computational Science Memorial University of Newfoundland Class Project for Bio 4241 March 27, 2014 Charles Chilaka (MUN) Genetic algorithms and programming

More information

Neural Network Weight Selection Using Genetic Algorithms

Neural Network Weight Selection Using Genetic Algorithms Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks

More information

QTL Analysis with QGene Tutorial

QTL Analysis with QGene Tutorial QTL Analysis with QGene Tutorial Phillip McClean 1. Getting the software. The first step is to download and install the QGene software. It can be obtained from the following WWW site: http://qgene.org

More information

The Imprinting Model

The Imprinting Model The Imprinting Model Version 1.0 Zhong Wang 1 and Chenguang Wang 2 1 Department of Public Health Science, Pennsylvania State University 2 Office of Surveillance and Biometrics, Center for Devices and Radiological

More information

M(ARK)S(IM) Dec. 1, 2009 Payseur Lab University of Wisconsin

M(ARK)S(IM) Dec. 1, 2009 Payseur Lab University of Wisconsin M(ARK)S(IM) Dec. 1, 2009 Payseur Lab University of Wisconsin M(ARK)S(IM) extends MS by enabling the user to simulate microsatellite data sets under a variety of mutational models. Simulated data sets are

More information

Documentation for OptiMAS: a decision support tool for marker-assisted assembly of diverse alleles

Documentation for OptiMAS: a decision support tool for marker-assisted assembly of diverse alleles Documentation for OptiMAS: a decision support tool for marker-assisted assembly of diverse alleles Version 1.5 F. Valente, F. Gauthier, N. Bardol, G. Blanc, J. Joets, A. Charcosset & L. Moreau Code by

More information

Simulation Study on the Methods for Mapping Quantitative Trait Loci in Inbred Line Crosses

Simulation Study on the Methods for Mapping Quantitative Trait Loci in Inbred Line Crosses Simulation Study on the Methods for Mapping Quantitative Trait Loci in Inbred Line Crosses A Dissertation Submitted in Partial Fulfilment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY in Genetics

More information

BioMERCATOR version 2.0

BioMERCATOR version 2.0 BioMERCATOR version 2.0 Software for genetic maps display, maps projection and QTL meta-analysis Anne Arcade, Aymeric Labourdette, Fabien Chardon, Matthieu Falque, Alain Charcosset, Johann Joets Contacts:

More information

SNP HiTLink Manual. Yoko Fukuda 1, Hiroki Adachi 2, Eiji Nakamura 2, and Shoji Tsuji 1

SNP HiTLink Manual. Yoko Fukuda 1, Hiroki Adachi 2, Eiji Nakamura 2, and Shoji Tsuji 1 SNP HiTLink Manual Yoko Fukuda 1, Hiroki Adachi 2, Eiji Nakamura 2, and Shoji Tsuji 1 1 Department of Neurology, Graduate School of Medicine, the University of Tokyo, Tokyo, Japan 2 Dynacom Co., Ltd, Kanagawa,

More information

Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism

Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism in Artificial Life VIII, Standish, Abbass, Bedau (eds)(mit Press) 2002. pp 182 185 1 Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism Shengxiang Yang Department of Mathematics and Computer

More information

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate

More information

Linkage Disequilibrium Map by Unidimensional Nonnegative Scaling

Linkage Disequilibrium Map by Unidimensional Nonnegative Scaling The First International Symposium on Optimization and Systems Biology (OSB 07) Beijing, China, August 8 10, 2007 Copyright 2007 ORSC & APORC pp. 302 308 Linkage Disequilibrium Map by Unidimensional Nonnegative

More information

SOLOMON: Parentage Analysis 1. Corresponding author: Mark Christie

SOLOMON: Parentage Analysis 1. Corresponding author: Mark Christie SOLOMON: Parentage Analysis 1 Corresponding author: Mark Christie christim@science.oregonstate.edu SOLOMON: Parentage Analysis 2 Table of Contents: Installing SOLOMON on Windows/Linux Pg. 3 Installing

More information

Step-by-Step Guide to Advanced Genetic Analysis

Step-by-Step Guide to Advanced Genetic Analysis Step-by-Step Guide to Advanced Genetic Analysis Page 1 Introduction In the previous document, 1 we covered the standard genetic analyses available in JMP Genomics. Here, we cover the more advanced options

More information

Intersection Tests for Single Marker QTL Analysis can be More Powerful Than Two Marker QTL Analysis

Intersection Tests for Single Marker QTL Analysis can be More Powerful Than Two Marker QTL Analysis Purdue University Purdue e-pubs Department of Statistics Faculty Publications Department of Statistics 6-19-2003 Intersection Tests for Single Marker QTL Analysis can be More Powerful Than Two Marker QTL

More information

Tutorial of the Breeding Planner (BP) for Marker Assisted Recurrent Selection (MARS)

Tutorial of the Breeding Planner (BP) for Marker Assisted Recurrent Selection (MARS) Tutorial of the Breeding Planner (BP) for Marker Assisted Recurrent Selection (MARS) BP system consists of three tools relevant to molecular breeding. MARS: Marker Assisted Recurrent Selection MABC: Marker

More information

Minimum Recombinant Haplotype Configuration on Tree Pedigrees (Extended Abstract)

Minimum Recombinant Haplotype Configuration on Tree Pedigrees (Extended Abstract) Minimum Recombinant Haplotype Configuration on Tree Pedigrees (Extended Abstract) Koichiro Doi 1, Jing Li 2, and Tao Jiang 2 1 Department of Computer Science Graduate School of Information Science and

More information

DESIGN AND ANALYSIS OF AN EFFICIENT RECURSIVE LINKING ALGORITHM FOR CONSTRUCTING LIKELIHOOD BASED GENETIC MAPS FOR A LARGE NUMBER OF MARKERS

DESIGN AND ANALYSIS OF AN EFFICIENT RECURSIVE LINKING ALGORITHM FOR CONSTRUCTING LIKELIHOOD BASED GENETIC MAPS FOR A LARGE NUMBER OF MARKERS Journal of Bioinformatics and Computational Biology Vol. 5, No. 2(a) (2007) 201 250 c Imperial College Press DESIGN AND ANALYSIS OF AN EFFICIENT RECURSIVE LINKING ALGORITHM FOR CONSTRUCTING LIKELIHOOD

More information

QTX. Tutorial for. by Kim M.Chmielewicz Kenneth F. Manly. Software for genetic mapping of Mendelian markers and quantitative trait loci.

QTX. Tutorial for. by Kim M.Chmielewicz Kenneth F. Manly. Software for genetic mapping of Mendelian markers and quantitative trait loci. Tutorial for QTX by Kim M.Chmielewicz Kenneth F. Manly Software for genetic mapping of Mendelian markers and quantitative trait loci. Available in versions for Mac OS and Microsoft Windows. revised for

More information

Forensic Resource/Reference On Genetics knowledge base: FROG-kb User s Manual. Updated June, 2017

Forensic Resource/Reference On Genetics knowledge base: FROG-kb User s Manual. Updated June, 2017 Forensic Resource/Reference On Genetics knowledge base: FROG-kb User s Manual Updated June, 2017 Table of Contents 1. Introduction... 1 2. Accessing FROG-kb Home Page and Features... 1 3. Home Page and

More information

Mutations for Permutations

Mutations for Permutations Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency

More information

fasta2genotype.py Version 1.10 Written for Python Available on request from the author 2017 Paul Maier

fasta2genotype.py Version 1.10 Written for Python Available on request from the author 2017 Paul Maier 1 fasta2genotype.py Version 1.10 Written for Python 2.7.10 Available on request from the author 2017 Paul Maier This program takes a fasta file listing all sequence haplotypes of all individuals at all

More information

Genetic Algorithms. Kang Zheng Karl Schober

Genetic Algorithms. Kang Zheng Karl Schober Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization

More information

GBS Bioinformatics Pipeline(s) Overview

GBS Bioinformatics Pipeline(s) Overview GBS Bioinformatics Pipeline(s) Overview Getting from sequence files to genotypes. Pipeline Coding: Ed Buckler Jeff Glaubitz James Harriman Presentation: Terry Casstevens With supporting information from

More information

And there s so much work to do, so many puzzles to ignore.

And there s so much work to do, so many puzzles to ignore. And there s so much work to do, so many puzzles to ignore. Och det finns så mycket jobb att ta sig an, så många gåtor att strunta i. John Ashbery, ur Little Sick Poem (övers: Tommy Olofsson & Vasilis Papageorgiou)

More information

Package REGENT. R topics documented: August 19, 2015

Package REGENT. R topics documented: August 19, 2015 Package REGENT August 19, 2015 Title Risk Estimation for Genetic and Environmental Traits Version 1.0.6 Date 2015-08-18 Author Daniel J.M. Crouch, Graham H.M. Goddard & Cathryn M. Lewis Maintainer Daniel

More information

Package EBglmnet. January 30, 2016

Package EBglmnet. January 30, 2016 Type Package Package EBglmnet January 30, 2016 Title Empirical Bayesian Lasso and Elastic Net Methods for Generalized Linear Models Version 4.1 Date 2016-01-15 Author Anhui Huang, Dianting Liu Maintainer

More information

Genet. Sel. Evol. 36 (2004) c INRA, EDP Sciences, 2004 DOI: /gse: Original article

Genet. Sel. Evol. 36 (2004) c INRA, EDP Sciences, 2004 DOI: /gse: Original article Genet. Sel. Evol. 36 (2004) 455 479 455 c INRA, EDP Sciences, 2004 DOI: 10.1051/gse:2004011 Original article A simulation study on the accuracy of position and effect estimates of linked QTL and their

More information

freebayes in depth: model, filtering, and walkthrough Erik Garrison Wellcome Trust Sanger of Iowa May 19, 2015

freebayes in depth: model, filtering, and walkthrough Erik Garrison Wellcome Trust Sanger of Iowa May 19, 2015 freebayes in depth: model, filtering, and walkthrough Erik Garrison Wellcome Trust Sanger Institute @University of Iowa May 19, 2015 Overview 1. Primary filtering: Bayesian callers 2. Post-call filtering:

More information

Hidden Markov Models in the context of genetic analysis

Hidden Markov Models in the context of genetic analysis Hidden Markov Models in the context of genetic analysis Vincent Plagnol UCL Genetics Institute November 22, 2012 Outline 1 Introduction 2 Two basic problems Forward/backward Baum-Welch algorithm Viterbi

More information

Version 2.0 Zhong Wang Department of Public Health Sciences Pennsylvannia State University

Version 2.0 Zhong Wang Department of Public Health Sciences Pennsylvannia State University The Funmap Package Version 2.0 Zhong Wang Department of Public Health Sciences Pennsylvannia State University 1. Introduction The Funmap package is developed to identify quantitative trait loci (QTL) for

More information

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's

More information

Step-by-Step Guide to Basic Genetic Analysis

Step-by-Step Guide to Basic Genetic Analysis Step-by-Step Guide to Basic Genetic Analysis Page 1 Introduction This document shows you how to clean up your genetic data, assess its statistical properties and perform simple analyses such as case-control

More information

Breeding Management System

Breeding Management System Breeding Management System Version 3.0 Complete User Manual September 2014 ibp@cgiar.org Funding & Acknowledgements The Integrated Breeding Platform (IBP) is jointly funded by: the Bill and Melinda Gates

More information

HapBlock A Suite of Dynamic Programming Algorithms for Haplotype Block Partitioning and Tag SNP Selection Based on Haplotype and Genotype Data

HapBlock A Suite of Dynamic Programming Algorithms for Haplotype Block Partitioning and Tag SNP Selection Based on Haplotype and Genotype Data HapBlock A Suite of Dynamic Programming Algorithms for Haplotype Block Partitioning and Tag SNP Selection Based on Haplotype and Genotype Data Introduction The suite of programs, HapBlock, is developed

More information

LDsplit: A Java Program for Association Studies of Meiotic Recombination Hotspots Using SNP Data

LDsplit: A Java Program for Association Studies of Meiotic Recombination Hotspots Using SNP Data LDsplit: A Java Program for Association Studies of Meiotic Recombination Hotspots Using SNP Data Peng Yang, Jing Guo and Jie Zheng* Bioinformatics Research Centre (BIRC) School of Computer Engineering

More information

CS5401 FS2015 Exam 1 Key

CS5401 FS2015 Exam 1 Key CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015

More information

Monika Maharishi Dayanand University Rohtak

Monika Maharishi Dayanand University Rohtak Performance enhancement for Text Data Mining using k means clustering based genetic optimization (KMGO) Monika Maharishi Dayanand University Rohtak ABSTRACT For discovering hidden patterns and structures

More information

KGG: A systematic biological Knowledge-based mining system for Genomewide Genetic studies (Version 3.5) User Manual. Miao-Xin Li, Jiang Li

KGG: A systematic biological Knowledge-based mining system for Genomewide Genetic studies (Version 3.5) User Manual. Miao-Xin Li, Jiang Li KGG: A systematic biological Knowledge-based mining system for Genomewide Genetic studies (Version 3.5) User Manual Miao-Xin Li, Jiang Li Department of Psychiatry Centre for Genomic Sciences Department

More information

Additional file 1 Figure S1.

Additional file 1 Figure S1. Additional file 1 Figure S1. Comparison of s estimates for the isolation (ISO) model with recent divergence using different starting points and parameter perturbation settings. Sample sizes are given above

More information

Breeding View A visual tool for running analytical pipelines User Guide Darren Murray, Roger Payne & Zhengzheng Zhang VSN International Ltd

Breeding View A visual tool for running analytical pipelines User Guide Darren Murray, Roger Payne & Zhengzheng Zhang VSN International Ltd Breeding View A visual tool for running analytical pipelines User Guide Darren Murray, Roger Payne & Zhengzheng Zhang VSN International Ltd January 2015 1. Introduction The Breeding View is a visual tool

More information

Evaluation of Double Hierarchical Generalized Linear Model versus Empirical Bayes method A comparison on Barley dataset

Evaluation of Double Hierarchical Generalized Linear Model versus Empirical Bayes method A comparison on Barley dataset Evaluation of Double Hierarchical Generalized Linear Model versus Empirical Bayes method A comparison on Barley dataset Author: Lei Wang Supervisor: Majbritt Felleki D-level in Statistics, Spring 00 School

More information

Spotter Documentation Version 0.5, Released 4/12/2010

Spotter Documentation Version 0.5, Released 4/12/2010 Spotter Documentation Version 0.5, Released 4/12/2010 Purpose Spotter is a program for delineating an association signal from a genome wide association study using features such as recombination rates,

More information

Documentation for BayesAss 1.3

Documentation for BayesAss 1.3 Documentation for BayesAss 1.3 Program Description BayesAss is a program that estimates recent migration rates between populations using MCMC. It also estimates each individual s immigrant ancestry, the

More information

Outline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search

Outline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search Outline Genetic Algorithm Motivation Genetic algorithms An illustrative example Hypothesis space search Motivation Evolution is known to be a successful, robust method for adaptation within biological

More information

BICF Nano Course: GWAS GWAS Workflow Development using PLINK. Julia Kozlitina April 28, 2017

BICF Nano Course: GWAS GWAS Workflow Development using PLINK. Julia Kozlitina April 28, 2017 BICF Nano Course: GWAS GWAS Workflow Development using PLINK Julia Kozlitina Julia.Kozlitina@UTSouthwestern.edu April 28, 2017 Getting started Open the Terminal (Search -> Applications -> Terminal), and

More information

PLNT4610 BIOINFORMATICS FINAL EXAMINATION

PLNT4610 BIOINFORMATICS FINAL EXAMINATION 9:00 to 11:00 Friday December 6, 2013 PLNT4610 BIOINFORMATICS FINAL EXAMINATION Answer any combination of questions totalling to exactly 100 points. The questions on the exam sheet total to 120 points.

More information

Genetic Algorithms. Chapter 3

Genetic Algorithms. Chapter 3 Chapter 3 1 Contents of this Chapter 2 Introductory example. Representation of individuals: Binary, integer, real-valued, and permutation. Mutation operator. Mutation for binary, integer, real-valued,

More information

Parallel Algorithms and Implementations for Genetic Analysis of Quantitative Traits

Parallel Algorithms and Implementations for Genetic Analysis of Quantitative Traits IT Licentiate theses 2007-005 Parallel Algorithms and Implementations for Genetic Analysis of Quantitative Traits MAHEN JAYAWARDENA UPPSALA UNIVERSITY Department of Information Technology Parallel Algorithms

More information

The k-means Algorithm and Genetic Algorithm

The k-means Algorithm and Genetic Algorithm The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective

More information

Package dlmap. February 19, 2015

Package dlmap. February 19, 2015 Type Package Title Detection Localization Mapping for QTL Version 1.13 Date 2012-08-09 Author Emma Huang and Andrew George Package dlmap February 19, 2015 Maintainer Emma Huang Description

More information

Mendel and His Peas Investigating Monhybrid Crosses Using the Graphing Calculator

Mendel and His Peas Investigating Monhybrid Crosses Using the Graphing Calculator 20 Investigating Monhybrid Crosses Using the Graphing Calculator This activity will use the graphing calculator s random number generator to simulate the production of gametes in a monohybrid cross. The

More information

Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?)

Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?) SKIP - May 2004 Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?) S. G. Hohmann, Electronic Vision(s), Kirchhoff Institut für Physik, Universität Heidelberg Hardware Neuronale Netzwerke

More information

CHAPTER 4 FEATURE SELECTION USING GENETIC ALGORITHM

CHAPTER 4 FEATURE SELECTION USING GENETIC ALGORITHM CHAPTER 4 FEATURE SELECTION USING GENETIC ALGORITHM In this research work, Genetic Algorithm method is used for feature selection. The following section explains how Genetic Algorithm is used for feature

More information

GS3. Andrés Legarra. March 5, Genomic Selection Gibbs Sampling Gauss Seidel

GS3. Andrés Legarra. March 5, Genomic Selection Gibbs Sampling Gauss Seidel GS3 Genomic Selection Gibbs Sampling Gauss Seidel Andrés Legarra March 5, 2008 andres.legarra [at] toulouse.inra.fr INRA, UR 631, F-31326 Auzeville, France 1 Contents 1 Introduction 3 1.1 History...............................

More information

Core Hunter 3: flexible core subset selection

Core Hunter 3: flexible core subset selection De Beukelaer et al. BMC Bioinformatics (2018) 19:203 https://doi.org/10.1186/s12859-018-2209-z RESEARCH ARTICLE Open Access Core Hunter 3: flexible core subset selection Herman De Beukelaer 1*,GuyFDavenport

More information

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:

More information

Artificial Intelligence Application (Genetic Algorithm)

Artificial Intelligence Application (Genetic Algorithm) Babylon University College of Information Technology Software Department Artificial Intelligence Application (Genetic Algorithm) By Dr. Asaad Sabah Hadi 2014-2015 EVOLUTIONARY ALGORITHM The main idea about

More information

Descriptive Statistics, Standard Deviation and Standard Error

Descriptive Statistics, Standard Deviation and Standard Error AP Biology Calculations: Descriptive Statistics, Standard Deviation and Standard Error SBI4UP The Scientific Method & Experimental Design Scientific method is used to explore observations and answer questions.

More information

TREEQA: QUANTITATIVE GENOME WIDE ASSOCIATION MAPPING USING LOCAL PERFECT PHYLOGENY TREES

TREEQA: QUANTITATIVE GENOME WIDE ASSOCIATION MAPPING USING LOCAL PERFECT PHYLOGENY TREES TREEQA: QUANTITATIVE GENOME WIDE ASSOCIATION MAPPING USING LOCAL PERFECT PHYLOGENY TREES FENG PAN 1, LEONARD MCMILLAN 1, FERNANDO PARDO-MANUEL DE VILLENA 2, DAVID THREADGILL 2 AND WEI WANG 1 1 Department

More information

Population Genetics (52642)

Population Genetics (52642) Population Genetics (52642) Benny Yakir 1 Introduction In this course we will examine several topics that are related to population genetics. In each topic we will discuss briefly the biological background

More information

Genetic Algorithms Variations and Implementation Issues

Genetic Algorithms Variations and Implementation Issues Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary

More information

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China

More information

Genome-Wide Association Study Using

Genome-Wide Association Study Using has to Department of Epidemiology UT MD Anderson Cancer Center Houston, TX April 2, 2008 Programmers Cross Training Outline has to 1 has 2 to 3 Going object-oriented: Outline has Brief introduction to

More information

a continuous-time coalescent simulator of genomic diversity under arbitrarily complex evolutionary scenarios Laurent Excoffier

a continuous-time coalescent simulator of genomic diversity under arbitrarily complex evolutionary scenarios Laurent Excoffier a continuous-time coalescent simulator of genomic diversity under arbitrarily complex evolutionary scenarios Laurent Excoffier Computational and Molecular Population Genetics lab Institute of Ecology and

More information

How to Reveal Magnitude of Gene Signals: Hierarchical Hypergeometric Complementary Cumulative Distribution Function

How to Reveal Magnitude of Gene Signals: Hierarchical Hypergeometric Complementary Cumulative Distribution Function 797352EVB0010.1177/1176934318797352Evolutionary BioinformaticsKim review-article2018 How to Reveal Magnitude of Gene Signals: Hierarchical Hypergeometric Complementary Cumulative Distribution Function

More information

CTL mapping in R. Danny Arends, Pjotr Prins, and Ritsert C. Jansen. University of Groningen Groningen Bioinformatics Centre & GCC Revision # 1

CTL mapping in R. Danny Arends, Pjotr Prins, and Ritsert C. Jansen. University of Groningen Groningen Bioinformatics Centre & GCC Revision # 1 CTL mapping in R Danny Arends, Pjotr Prins, and Ritsert C. Jansen University of Groningen Groningen Bioinformatics Centre & GCC Revision # 1 First written: Oct 2011 Last modified: Jan 2018 Abstract: Tutorial

More information

Chapter 9: Genetic Algorithms

Chapter 9: Genetic Algorithms Computational Intelligence: Second Edition Contents Compact Overview First proposed by Fraser in 1957 Later by Bremermann in 1962 and Reed et al in 1967 Popularized by Holland in 1975 Genetic algorithms

More information

On a Divide and Conquer Approach for Haplotype Inference with Pure Parsimony

On a Divide and Conquer Approach for Haplotype Inference with Pure Parsimony On a Divide and Conquer Approach for Haplotype Inference with Pure Parsimony Konstantinos Kalpakis, and Parag Namjoshi Department of Computer Science and Electrical Engineering University of Maryland Baltimore

More information

MLSTest Tutorial Contents

MLSTest Tutorial Contents MLSTest Tutorial Contents About MLSTest... 2 Installing MLSTest... 2 Loading Data... 3 Main window... 4 DATA Menu... 5 View, modify and export your alignments... 6 Alignment>viewer... 6 Alignment> export...

More information

PLNT4610 BIOINFORMATICS FINAL EXAMINATION

PLNT4610 BIOINFORMATICS FINAL EXAMINATION PLNT4610 BIOINFORMATICS FINAL EXAMINATION 18:00 to 20:00 Thursday December 13, 2012 Answer any combination of questions totalling to exactly 100 points. The questions on the exam sheet total to 120 points.

More information

User Manual for BALLET v1.0

User Manual for BALLET v1.0 User Manual for BALLET v1.0 Michael DeGiorgio, Kirk E. Lohmueller, Rasmus Nielsen August 27, 2014 1 1. Introduction BALLET is a program to perform genome-wide scans of ancient balancing selection using

More information

Applying genetic algorithm on power system stabilizer for stabilization of power system

Applying genetic algorithm on power system stabilizer for stabilization of power system Applying genetic algorithm on power system stabilizer for stabilization of power system 1,3 Arnawan Hasibuan and 2,3 Syafrudin 1 Engineering Department of Malikussaleh University, Lhokseumawe, Indonesia;

More information

Package skelesim. November 27, 2017

Package skelesim. November 27, 2017 Package skelesim Type Package Title Genetic Simulation Engine Version 0.9.8 November 27, 2017 URL https://github.com/christianparobek/skelesim BugReports https://github.com/christianparobek/skelesim/issues

More information

Genetic Analysis. Page 1

Genetic Analysis. Page 1 Genetic Analysis Page 1 Genetic Analysis Objectives: 1) Set up Case-Control Association analysis and the Basic Genetics Workflow 2) Use JMP tools to interact with and explore results 3) Learn advanced

More information

GWAsimulator: A rapid whole-genome simulation program

GWAsimulator: A rapid whole-genome simulation program GWAsimulator: A rapid whole-genome simulation program Version 1.1 Chun Li and Mingyao Li September 21, 2007 (revised October 9, 2007) 1. Introduction...1 2. Download and compile the program...2 3. Input

More information

Time Complexity Analysis of the Genetic Algorithm Clustering Method

Time Complexity Analysis of the Genetic Algorithm Clustering Method Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti

More information

GMDR User Manual. GMDR software Beta 0.9. Updated March 2011

GMDR User Manual. GMDR software Beta 0.9. Updated March 2011 GMDR User Manual GMDR software Beta 0.9 Updated March 2011 1 As an open source project, the source code of GMDR is published and made available to the public, enabling anyone to copy, modify and redistribute

More information

Estimating. Local Ancestry in admixed Populations (LAMP)

Estimating. Local Ancestry in admixed Populations (LAMP) Estimating Local Ancestry in admixed Populations (LAMP) QIAN ZHANG 572 6/05/2014 Outline 1) Sketch Method 2) Algorithm 3) Simulated Data: Accuracy Varying Pop1-Pop2 Ancestries r 2 pruning threshold Number

More information

EVALUATION OF THE NORMAL APPROXIMATION FOR THE PAIRED TWO SAMPLE PROBLEM WITH MISSING DATA. Shang-Lin Yang. B.S., National Taiwan University, 1996

EVALUATION OF THE NORMAL APPROXIMATION FOR THE PAIRED TWO SAMPLE PROBLEM WITH MISSING DATA. Shang-Lin Yang. B.S., National Taiwan University, 1996 EVALUATION OF THE NORMAL APPROXIMATION FOR THE PAIRED TWO SAMPLE PROBLEM WITH MISSING DATA By Shang-Lin Yang B.S., National Taiwan University, 1996 M.S., University of Pittsburgh, 2005 Submitted to the

More information

Genetic algorithms in computer aided design

Genetic algorithms in computer aided design Loughborough University Institutional Repository Genetic algorithms in computer aided design This item was submitted to Loughborough University's Institutional Repository by the/an author. Citation: GRAHAM,

More information

RAD Population Genomics Programs Paul Hohenlohe 6/2014

RAD Population Genomics Programs Paul Hohenlohe 6/2014 RAD Population Genomics Programs Paul Hohenlohe (hohenlohe@uidaho.edu) 6/2014 I. Overview These programs are designed to conduct population genomic analysis on RAD sequencing data. They were designed for

More information

Bayesian Multiple QTL Mapping

Bayesian Multiple QTL Mapping Bayesian Multiple QTL Mapping Samprit Banerjee, Brian S. Yandell, Nengjun Yi April 28, 2006 1 Overview Bayesian multiple mapping of QTL library R/bmqtl provides Bayesian analysis of multiple quantitative

More information

ATHENA Manual. Table of Contents...1 Introduction...1 Example...1 Input Files...2 Algorithms...7 Sample files...8

ATHENA Manual. Table of Contents...1 Introduction...1 Example...1 Input Files...2 Algorithms...7 Sample files...8 Last Updated: 01/30/2012 ATHENA Manual Table of Contents Table of Contents...1 Introduction...1 Example...1 Input Files...2 Algorithms...7 Sample files...8 Introduction ATHENA applies grammatical evolution

More information

Table S1. Phenotypic and molecular screening results based on 36 F1 generation seeds of commercial tomato hybrid varieties.

Table S1. Phenotypic and molecular screening results based on 36 F1 generation seeds of commercial tomato hybrid varieties. Table S1. Phenotypic and molecular screening results based on 36 F1 generation seeds of commercial tomato hybrid varieties. Serial No Variety Name Type of seed Field screening P2017.04.9 Molecular Screening

More information

Haplotype analysis in population-based association studies

Haplotype analysis in population-based association studies The Stata Journal (2001) 1, Number 1, pp. 58 75 Haplotype analysis in population-based association studies A. P. Mander MRC Biostatistics Unit, Cambridge, UK adrian.mander@mrc-bsu.cam.ac.uk Abstract. This

More information

Evolutionary Computation Part 2

Evolutionary Computation Part 2 Evolutionary Computation Part 2 CS454, Autumn 2017 Shin Yoo (with some slides borrowed from Seongmin Lee @ COINSE) Crossover Operators Offsprings inherit genes from their parents, but not in identical

More information

Hierarchical Crossover in Genetic Algorithms

Hierarchical Crossover in Genetic Algorithms Hierarchical Crossover in Genetic Algorithms P. J. Bentley* & J. P. Wakefield Abstract This paper identifies the limitations of conventional crossover in genetic algorithms when operating on two chromosomes

More information

Package Hapi. July 28, 2018

Package Hapi. July 28, 2018 Type Package Package Hapi July 28, 2018 Title Inference of Chromosome-Length Haplotypes Using Genomic Data of Single Gamete Cells Version 0.0.3 Author, Han Qu, Jinfeng Chen, Shibo Wang, Le Zhang, Julong

More information

EFFICIENT HAPLOTYPE INFERENCE FROM PEDIGREES WITH MISSING DATA USING LINEAR SYSTEMS WITH DISJOINT-SET DATA STRUCTURES

EFFICIENT HAPLOTYPE INFERENCE FROM PEDIGREES WITH MISSING DATA USING LINEAR SYSTEMS WITH DISJOINT-SET DATA STRUCTURES 1 EFFICIENT HAPLOTYPE INFERENCE FROM PEDIGREES WITH MISSING DATA USING LINEAR SYSTEMS WITH DISJOINT-SET DATA STRUCTURES Xin Li and Jing Li Department of Electrical Engineering and Computer Science, Case

More information

msbgs - a program for generating samples under background selection models

msbgs - a program for generating samples under background selection models msbgs - a program for generating samples under background selection models Kai Zeng Department of Animal and Plant Sciences, University of Sheffield, UK k.zeng@sheffield.ac.uk Version 1.01 1 Introduction

More information

Evolutionary Computation: Solution Representation. Set Covering Problem. Set Covering Problem. Set Covering Problem 2/28/2008.

Evolutionary Computation: Solution Representation. Set Covering Problem. Set Covering Problem. Set Covering Problem 2/28/2008. Evolutionary Computation: Solution Representation Andrew Kusiak 9 Seamans Center Iowa City, Iowa - Tel: 9-9 Fax: 9-669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Set Covering Problem

More information