Chris Thachuk


Ontology type: schema:Person     


Person Info

NAME

Chris

SURNAME

Thachuk

Publications in SciGraph latest 50 shown

  • 2017-08-24 Inferring Parameters for an Elementary Step Model of DNA Structure Kinetics with Locally Context-Dependent Arrhenius Rates in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2017-08-24 A General-Purpose CRN-to-DSD Compiler with Formal Verification, Optimization, and Simulation Capabilities in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2017-08-24 Thermodynamic Binding Networks in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2017-08-24 The Design Space of Strand Displacement Cascades with Toehold-Size Clamps in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2017-02-23 Compiler-aided systematic construction of large-scale DNA strand displacement circuits using unpurified components in NATURE COMMUNICATIONS
  • 2015-07-21 Leakless DNA Strand Displacement Systems in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2015-07-21 Stochastic Simulation of the Kinetics of Multiple Interacting Nucleic Acid Strands in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2014-06-07 DNA walker circuits: computational potential, design, and verification in NATURAL COMPUTING
  • 2014 Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2013 DNA Walker Circuits: Computational Potential, Design, and Verification in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2013 Logically and Physically Reversible Natural Computing: A Tutorial in REVERSIBLE COMPUTATION
  • 2012 The Complexity of String Partitioning in COMBINATORIAL PATTERN MATCHING
  • 2012 Space and Energy Efficient Computation with DNA Strand Displacement Systems in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2011 A Succinct Index for Hypertext in STRING PROCESSING AND INFORMATION RETRIEVAL
  • 2011 Succincter Text Indexing with Wildcards in COMBINATORIAL PATTERN MATCHING
  • 2011 Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2011 Complexity of Finding Non-Planar Rectilinear Drawings of Graphs in GRAPH DRAWING
  • 2011 Efficient Codon Optimization with Motif Engineering in COMBINATORIAL ALGORITHMS
  • 2010-11-26 NP-completeness of the energy barrier problem without pseudoknots and temporary arcs in NATURAL COMPUTING
  • 2009-08-06 Core Hunter: an algorithm for sampling genetic resources based on multiple genetic measures in BMC BIOINFORMATICS
  • 2009 NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots in DNA COMPUTING AND MOLECULAR PROGRAMMING
  • 2008-01-01 Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis in COMPUTING AND COMBINATORICS
  • 2007-09-17 A replica exchange Monte Carlo algorithm for protein folding in the HP model in BMC BIOINFORMATICS
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.20861.3d", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.61971.38", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.17091.3e", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.4991.5", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.34477.33", 
            "type": "Organization"
          }
        ], 
        "familyName": "Thachuk", 
        "givenName": "Chris", 
        "id": "sg:person.01122734315.29", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01122734315.29"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_756.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.01122734315.29'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.01122734315.29'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.01122734315.29'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.01122734315.29'


     




    Preview window. Press ESC to close (or click here)


    ...