default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Thachuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Lancelot Wathieu
, Gus Henry Smith, Luis Ceze, Chris Thachuk:
Fridge Compiler: Optimal Circuits from Molecular Inventories. CMSB 2023: 236-252- [c24]Ahmed Shalaby, Chris Thachuk, Damien Woods:
Minimum Free Energy, Partition Function and Kinetics Simulation Algorithms for a Multistranded Scaffolded DNA Computer. DNA 2023: 1:1-1:22 - 2022
- [c23]Tiernan Kennedy, Cadence Pearce, Chris Thachuk:
Fast and Robust Strand Displacement Cascades via Systematic Design Strategies. DNA 2022: 1:1-1:17 - 2021
- [c22]Anne Condon, Monir Hajiaghayi, Chris Thachuk:
Predicting Minimum Free Energy Structures of Multi-Stranded Nucleic Acid Complexes Is APX-Hard. DNA 2021: 9:1-9:21
2010 – 2019
- 2019
- [j11]Seung Woo Shin, Chris Thachuk, Erik Winfree:
Verifying chemical reaction network implementations: A pathway decomposition approach. Theor. Comput. Sci. 765: 67-96 (2019) - [j10]Keenan Breik, Chris Thachuk, Marijn Heule, David Soloveichik:
Computing properties of stable configurations of thermodynamic binding networks. Theor. Comput. Sci. 785: 17-29 (2019) - [e1]Chris Thachuk, Yan Liu:
DNA Computing and Molecular Programming - 25th International Conference, DNA 25, Seattle, WA, USA, August 5-9, 2019, Proceedings. Lecture Notes in Computer Science 11648, Springer 2019, ISBN 978-3-030-26806-0 [contents] - 2017
- [c21]Boya Wang, Chris Thachuk, Andrew D. Ellington, David Soloveichik:
The Design Space of Strand Displacement Cascades with Toehold-Size Clamps. DNA 2017: 64-81 - [c20]Sedigheh Zolaktaf, Frits Dannenberg, Xander Rudelis, Anne Condon, Joseph M. Schaeffer, Mark Schmidt, Chris Thachuk, Erik Winfree:
Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally Context-Dependent Arrhenius Rates. DNA 2017: 172-187 - [c19]Stefan Badelt, Seung Woo Shin, Robert F. Johnson, Qing Dong, Chris Thachuk, Erik Winfree:
A General-Purpose CRN-to-DSD Compiler with Formal Verification, Optimization, and Simulation Capabilities. DNA 2017: 232-248 - [c18]David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods:
Thermodynamic Binding Networks. DNA 2017: 249-266 - [i6]David Doty, Trent A. Rogers, David Soloveichik, Chris Thachuk, Damien Woods:
Thermodynamic Binding Networks. CoRR abs/1709.07922 (2017) - [i5]Keenan Breik, Lakshmi Prakash, Chris Thachuk, Marijn Heule, David Soloveichik:
Computing properties of stable configurations of thermodynamic binding networks. CoRR abs/1709.08731 (2017) - 2016
- [j9]Marta Kwiatkowska, Andrew Phillips, Chris Thachuk:
Preface. Theor. Comput. Sci. 632: 2-3 (2016) - [c17]Ashwin Gopinath, David G. Kirkpatrick, Paul W. K. Rothemund, Chris Thachuk:
Progressive Alignment of Shapes. CCCG 2016: 230-236 - 2015
- [j8]Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. J. Discrete Algorithms 32: 24-43 (2015) - [j7]Frits Dannenberg, Marta Z. Kwiatkowska, Chris Thachuk, Andrew J. Turberfield:
DNA walker circuits: computational potential, design, and verification. Nat. Comput. 14(2): 195-211 (2015) - [c16]Chris Thachuk, Erik Winfree, David Soloveichik:
Leakless DNA Strand Displacement Systems. DNA 2015: 133-153 - [c15]Joseph Malcolm Schaeffer, Chris Thachuk, Erik Winfree:
Stochastic Simulation of the Kinetics of Multiple Interacting Nucleic Acid Strands. DNA 2015: 194-211 - 2014
- [c14]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. DNA 2014: 20-36 - [p1]Marta Z. Kwiatkowska, Chris Thachuk:
Probabilistic Model Checking for Biology. Software Systems Safety 2014: 165-189 - [i4]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast algorithmic self-assembly of simple shapes using random agitation. CoRR abs/1409.4828 (2014) - [i3]Seung Woo Shin, Chris Thachuk, Erik Winfree:
Verifying Chemical Reaction Network Implementations: A Pathway Decomposition Approach. CoRR abs/1411.0782 (2014) - 2013
- [j6]Chris Thachuk:
Indexing hypertext. J. Discrete Algorithms 18: 113-122 (2013) - [j5]Chris Thachuk:
Compressed indexes for text with wildcards. Theor. Comput. Sci. 483: 22-35 (2013) - [c13]Frits Dannenberg, Marta Z. Kwiatkowska, Chris Thachuk, Andrew J. Turberfield:
DNA Walker Circuits: Computational Potential, Design, and Verification. DNA 2013: 31-45 - [c12]Chris Thachuk:
Logically and Physically Reversible Natural Computing: A Tutorial. RC 2013: 247-262 - 2012
- [j4]Anne Condon, Chris Thachuk:
Efficient codon optimization with motif engineering. J. Discrete Algorithms 16: 104-112 (2012) - [c11]Anne Condon, Ján Manuch, Chris Thachuk:
The Complexity of String Partitioning. CPM 2012: 159-172 - [c10]Chris Thachuk, Anne Condon:
Space and Energy Efficient Computation with DNA Strand Displacement Systems. DNA 2012: 135-149 - [i2]Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. CoRR abs/1204.2201 (2012) - 2011
- [j3]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10(1): 391-405 (2011) - [c9]Chris Thachuk:
Succincter Text Indexing with Wildcards. CPM 2011: 27-40 - [c8]Anne Condon, Alan J. Hu, Ján Manuch, Chris Thachuk:
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems. DNA 2011: 84-99 - [c7]Anne Condon, Chris Thachuk:
Efficient Codon Optimization with Motif Engineering. IWOCA 2011: 337-348 - [c6]Chris Thachuk:
A Succinct Index for Hypertext. SPIRE 2011: 209-220 - [i1]Chris Thachuk:
Succincter Text Indexing with Wildcards. CoRR abs/1101.5376 (2011) - 2010
- [c5]Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk:
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. GD 2010: 305-316 - [c4]Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon:
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119
2000 – 2009
- 2009
- [j2]Chris Thachuk, Jose Crossa, Jorge Franco, Susanne Dreisigacker, Marilyn Warburton, Guy F. Davenport:
Core Hunter: an algorithm for sampling genetic resources based on multiple genetic measures. BMC Bioinform. 10 (2009) - [c3]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115 - 2008
- [c2]Anne Condon, Ján Manuch, Chris Thachuk:
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. COCOON 2008: 265-275 - 2007
- [j1]Chris Thachuk, Alena Shmygelska, Holger H. Hoos:
A replica exchange Monte Carlo algorithm for protein folding in the HP model. BMC Bioinform. 8 (2007) - [c1]Chris Thachuk, Anne Condon:
On the Design of Oligos for Gene Synthesis. BIBE 2007: 123-130
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
