Laurie J. Heyer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Laurie J. Heyer has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
- A. Malcolm Campbell
Department of Biology, Davidson College, Davidson, NC 28035
4 shared publications - Todd T. Eckdahl
Department of Biology, Missouri Western State University, Saint Joseph, USA
4 shared publications - Jeffrey L. Poet
Department of Computer Science, Math, and Physics, Missouri Western State University, Saint Joseph, USA
3 shared publications - James O Dickson
Department of Mathematics, Davidson College, Davidson, NC 28036, USA
2 shared publications - Lane Heard
Department of Biology, Missouri Western State University, St Joseph, MO 64507, USA
2 shared publications A. M. Campbell
Department of Biology, Davidson College Davidson, NC, USA
1 shared publication
Latest Publications
- Open Access
Rényi's $α$-divergence variational Bayes for spike-and-slab high-dimensional linear regression
Sparse high-dimensional linear regression is a central problem in statistics, where the goal is often variable selection and/or coefficient estimation. We propose a mean-field variational Bayes approximation for sparse regression with spike-and-slab Laplace priors that replaces the standard Kullback-Leibler (KL) divergence objective with the Rényi's $α$ divergence: a one-parameter generalization of KL divergence indexed by $α\in (0, \infty) \setminus \{1\}$ that allows flexibility between zero-forcing and mass-covering behavior. We derive coordinate ascent variational inference (CAVI) updates via a second-order delta method and develop a stochastic variational inference algorithm based on a Monte Carlo surrogate Rényi lower bound. In simulations, our two methods perform comparably to state-of-the-art Bayesian variable selection procedures across a range of sparsity configurations and $α$ values for both variable selection and estimation, and our numerical results illustrate how different choices of $α$ can be advantageous in different sparsity configurations.Open AccessRényi's $α$-divergence variational Bayes for spike-and-slab high-dimensional linear regression
Sparse high-dimensional linear regression is a central problem in statistics, where the goal is often variable selection and/or coefficient estimation. We propose a mean-field variational Bayes approximation for sparse regression with spike-and-slab Laplace priors that replaces the standard Kullback-Leibler (KL) divergence objective with the Rényi's $α$ divergence: a one-parameter generalization of KL divergence indexed by $α\in (0, \infty) \setminus \{1\}$ that allows flexibility between zero-forcing and mass-covering behavior. We derive coordinate ascent variational inference (CAVI) updates via a second-order delta method and develop a stochastic variational inference algorithm based on a Monte Carlo surrogate Rényi lower bound. In simulations, our two methods perform comparably to state-of-the-art Bayesian variable selection procedures across a range of sparsity configurations and $α$ values for both variable selection and estimation, and our numerical results illustrate how different choices of $α$ can be advantageous in different sparsity configurations. - Open Access
- 5 December 2018
- Published by Springer Nature in BMC Research Notes
- Vol. 11 (1) , 861
Attempted use of PACE for riboswitch discovery generates three new translational theophylline riboswitch side products
The purpose of this project was to use an in vivo method to discover riboswitches that are activated by new ligands. We employed phage-assisted continuous evolution (PACE) to evolve new riboswitches in vivo. We started with one translational riboswitch and one transcriptional riboswitch, both of which were activated by theophylline. We used xanthine as the new target ligand during positive selection followed by negative selection using theophylline. The goal was to generate very large M13 phage populations that contained unknown mutations, some of which would result in new aptamer specificity. We discovered side products of three new theophylline translational riboswitches with different levels of protein production. We used next generation sequencing to identify M13 phage that carried riboswitch mutations. We cloned and characterized the most abundant riboswitch mutants and discovered three variants that produce different levels of translational output while retaining their theophylline specificity. Although we were unable to demonstrate evolution of new riboswitch ligand specificity using PACE, we recommend careful design of recombinant M13 phage to avoid evolution of “cheaters” that short circuit the intended selection pressure.
- 5 December 2018
- Published by Springer Nature in BMC Research Notes
- Vol. 11 (1) , 861
Open AccessAttempted use of PACE for riboswitch discovery generates three new translational theophylline riboswitch side products
The purpose of this project was to use an in vivo method to discover riboswitches that are activated by new ligands. We employed phage-assisted continuous evolution (PACE) to evolve new riboswitches in vivo. We started with one translational riboswitch and one transcriptional riboswitch, both of which were activated by theophylline. We used xanthine as the new target ligand during positive selection followed by negative selection using theophylline. The goal was to generate very large M13 phage populations that contained unknown mutations, some of which would result in new aptamer specificity. We discovered side products of three new theophylline translational riboswitches with different levels of protein production. We used next generation sequencing to identify M13 phage that carried riboswitch mutations. We cloned and characterized the most abundant riboswitch mutants and discovered three variants that produce different levels of translational output while retaining their theophylline specificity. Although we were unable to demonstrate evolution of new riboswitch ligand specificity using PACE, we recommend careful design of recombinant M13 phage to avoid evolution of “cheaters” that short circuit the intended selection pressure.
- Open Access
- 21 July 2011
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 5 (1) , 9
Word selection affects perceptions of synthetic biology
Members of the synthetic biology community have discussed the significance of word selection when describing synthetic biology to the general public. In particular, many leaders proposed the word "create" was laden with negative connotations. We found that word choice and framing does affect public perception of synthetic biology. In a controlled experiment, participants perceived synthetic biology more negatively when "create" was used to describe the field compared to "construct" (p = 0.008). Contrary to popular opinion among synthetic biologists, however, low religiosity individuals were more influenced negatively by the framing manipulation than high religiosity people. Our results suggest that synthetic biologists directly influence public perception of their field through avoidance of the word "create".
- 21 July 2011
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 5 (1) , 9
Open AccessWord selection affects perceptions of synthetic biology
Members of the synthetic biology community have discussed the significance of word selection when describing synthetic biology to the general public. In particular, many leaders proposed the word "create" was laden with negative connotations. We found that word choice and framing does affect public perception of synthetic biology. In a controlled experiment, participants perceived synthetic biology more negatively when "create" was used to describe the field compared to "construct" (p = 0.008). Contrary to popular opinion among synthetic biologists, however, low religiosity individuals were more influenced negatively by the framing manipulation than high religiosity people. Our results suggest that synthetic biologists directly influence public perception of their field through avoidance of the word "create".
- Open Access
- 24 July 2009
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 3 (1) , 11
Solving a Hamiltonian Path Problem with a bacterial computer
Background: The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results: We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion: We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node directed graph. This proof-of-concept experiment demonstrates that bacterial computing is a new way to address NP-complete problems using the inherent advantages of genetic systems. The results of our experiments also validate synthetic biology as a valuable approach to biological engineering. We designed and constructed basic parts, devices, and systems using synthetic biology principles of standardization and abstraction.
- 24 July 2009
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 3 (1) , 11
Open AccessSolving a Hamiltonian Path Problem with a bacterial computer
Background: The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results: We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion: We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node directed graph. This proof-of-concept experiment demonstrates that bacterial computing is a new way to address NP-complete problems using the inherent advantages of genetic systems. The results of our experiments also validate synthetic biology as a valuable approach to biological engineering. We designed and constructed basic parts, devices, and systems using synthetic biology principles of standardization and abstraction.
- Open Access
- 1 September 2008
- Published by American Society for Cell Biology (ASCB) in CBE—Life Sciences Education
- Vol. 7 (3) , 294-295
Learning the Lingo
- 1 September 2008
- Published by American Society for Cell Biology (ASCB) in CBE—Life Sciences Education
- Vol. 7 (3) , 294-295
Open AccessLearning the Lingo
- Open Access
- 20 May 2008
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 2 (1) , 1-12
Engineering bacteria to solve the Burnt Pancake Problem
We investigated the possibility of executing DNA-based computation in living cells by engineering Escherichia coli to address a classic mathematical puzzle called the Burnt Pancake Problem (BPP). The BPP is solved by sorting a stack of distinct objects (pancakes) into proper order and orientation using the minimum number of manipulations. Each manipulation reverses the order and orientation of one or more adjacent objects in the stack. We have designed a system that uses site-specific DNA recombination to mediate inversions of genetic elements that represent pancakes within plasmid DNA. Inversions (or "flips") of the DNA fragment pancakes are driven by the Salmonella typhimurium Hin/hix DNA recombinase system that we reconstituted as a collection of modular genetic elements for use in E. coli. Our system sorts DNA segments by inversions to produce different permutations of a promoter and a tetracycline resistance coding region; E. coli cells become antibiotic resistant when the segments are properly sorted. Hin recombinase can mediate all possible inversion operations on adjacent flippable DNA fragments. Mathematical modeling predicts that the system reaches equilibrium after very few flips, where equal numbers of permutations are randomly sorted and unsorted. Semiquantitative PCR analysis of in vivo flipping suggests that inversion products accumulate on a time scale of hours or days rather than minutes. The Hin/hix system is a proof-of-concept demonstration of in vivo computation with the potential to be scaled up to accommodate larger and more challenging problems. Hin/hix may provide a flexible new tool for manipulating transgenic DNA in vivo.
- 20 May 2008
- Published by Springer Nature in Journal of Biological Engineering
- Vol. 2 (1) , 1-12
Open AccessEngineering bacteria to solve the Burnt Pancake Problem
We investigated the possibility of executing DNA-based computation in living cells by engineering Escherichia coli to address a classic mathematical puzzle called the Burnt Pancake Problem (BPP). The BPP is solved by sorting a stack of distinct objects (pancakes) into proper order and orientation using the minimum number of manipulations. Each manipulation reverses the order and orientation of one or more adjacent objects in the stack. We have designed a system that uses site-specific DNA recombination to mediate inversions of genetic elements that represent pancakes within plasmid DNA. Inversions (or "flips") of the DNA fragment pancakes are driven by the Salmonella typhimurium Hin/hix DNA recombinase system that we reconstituted as a collection of modular genetic elements for use in E. coli. Our system sorts DNA segments by inversions to produce different permutations of a promoter and a tetracycline resistance coding region; E. coli cells become antibiotic resistant when the segments are properly sorted. Hin recombinase can mediate all possible inversion operations on adjacent flippable DNA fragments. Mathematical modeling predicts that the system reaches equilibrium after very few flips, where equal numbers of permutations are randomly sorted and unsorted. Semiquantitative PCR analysis of in vivo flipping suggests that inversion products accumulate on a time scale of hours or days rather than minutes. The Hin/hix system is a proof-of-concept demonstration of in vivo computation with the potential to be scaled up to accommodate larger and more challenging problems. Hin/hix may provide a flexible new tool for manipulating transgenic DNA in vivo.
- 17 January 2008
- Published by Taylor & Francis in PRIMUS
- Vol. 18 (1) , 101-118
A Mathematical Optimization Problem in Bioinformatics
This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted to mathematics courses in which mathematical optimization or algorithms are discussed.
- 17 January 2008
- Published by Taylor & Francis in PRIMUS
- Vol. 18 (1) , 101-118
A Mathematical Optimization Problem in Bioinformatics
This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted to mathematics courses in which mathematical optimization or algorithms are discussed.
- Open Access
- 1 January 2008
- Published by Springer Nature in BMC Genomics
- Vol. 9 (1) , 32
Microarray analysis of the in vivo sequence preferences of a minor groove binding drug
Minor groove binding drugs (MGBDs) interact with DNA in a sequence-specific manner and can cause changes in gene expression at the level of transcription. They serve as valuable models for protein interactions with DNA and form an important class of antitumor, antiviral, antitrypanosomal and antibacterial drugs. There is a need to extend knowledge of the sequence requirements for MGBDs from in vitro DNA binding studies to living cells.
- 1 January 2008
- Published by Springer Nature in BMC Genomics
- Vol. 9 (1) , 32
Open AccessMicroarray analysis of the in vivo sequence preferences of a minor groove binding drug
Minor groove binding drugs (MGBDs) interact with DNA in a sequence-specific manner and can cause changes in gene expression at the level of transcription. They serve as valuable models for protein interactions with DNA and form an important class of antitumor, antiviral, antitrypanosomal and antibacterial drugs. There is a need to extend knowledge of the sequence requirements for MGBDs from in vitro DNA binding studies to living cells.
- Open Access
- 10 January 2005
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (9) , 2114-2115
MAGIC Tool: integrated microarray data analysis
Summary: Several programs are now available for analyzing the large datasets arising from cDNA microarray experiments. Most programs are expensive commercial packages or require expensive third party software. Some are freely available to academic researchers, but are limited to one operating system. MicroArray Genome Imaging and Clustering Tool (MAGIC Tool) is an open source program that works on all major platforms, and takes users ‘from tiff to gif’. Several unique features of MAGIC Tool are particularly useful for research and teaching. Availability:http://www.bio.davidson.edu/MAGIC Contact:laheyer@davidson.edu
- 10 January 2005
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (9) , 2114-2115
Open AccessMAGIC Tool: integrated microarray data analysis
Summary: Several programs are now available for analyzing the large datasets arising from cDNA microarray experiments. Most programs are expensive commercial packages or require expensive third party software. Some are freely available to academic researchers, but are limited to one operating system. MicroArray Genome Imaging and Clustering Tool (MAGIC Tool) is an open source program that works on all major platforms, and takes users ‘from tiff to gif’. Several unique features of MAGIC Tool are particularly useful for research and teaching. Availability:http://www.bio.davidson.edu/MAGIC Contact:laheyer@davidson.edu