Chuan Yi Tang

Ontology type: schema:Person     

Person Info


Chuan Yi



Publications in SciGraph latest 50 shown

  • 2017-12 Bacterial diversity among four healthcare-associated institutes in Taiwan in SCIENTIFIC REPORTS
  • 2015-12 Isolation and Identification of Post-Transcriptional Gene Silencing-Related Micro-RNAs by Functionalized Silicon Nanowire Field-effect Transistor in SCIENTIFIC REPORTS
  • 2015-03 Application of 16S rRNA metagenomics to analyze bacterial communities at a respiratory care centre in Taiwan in APPLIED MICROBIOLOGY AND BIOTECHNOLOGY
  • 2015 Predicting RNA Secondary Structures: One-grammar-fits-all Solution in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2014-12 Transcriptome profiling in imipenem-selected Acinetobacter baumannii in BMC GENOMICS
  • 2013-12 The chromatin modification by SUMO-2/3 but not SUMO-1 prevents the epigenetic activation of key immune-related genes during Kaposi’s sarcoma associated herpesvirus reactivation in BMC GENOMICS
  • 2013-01 Reconstruction of phyletic trees by global alignment of multiple metabolic networks in BMC BIOINFORMATICS
  • 2012-12 Metabolic classification of microbial genomes using functional probes in BMC GENOMICS
  • 2012-12 An efficient RNA interference screening strategy for gene functional analysis in BMC GENOMICS
  • 2012-12 Whole-genome sequencing and identification of Morganella morganii KT pathogenicity-related genes in BMC GENOMICS
  • 2011-12 A genetic algorithm-based boolean delay model of intracellular signal transduction in inflammation in BMC BIOINFORMATICS
  • 2011-12 A novel method to identify cooperative functional modules: study of module coordination in the Saccharomyces cerevisiae cell cycle in BMC BIOINFORMATICS
  • 2010-12 Computational modeling with forward and reverse engineering links signaling network and genomic regulatory responses: NF-κB signaling-induced gene expression responses in inflammation in BMC BIOINFORMATICS
  • 2010-12 A parallel and incremental algorithm for efficient unique signature discovery on DNA databases in BMC BIOINFORMATICS
  • 2010-12 Feature amplified voting algorithm for functional analysis of protein superfamily in BMC GENOMICS
  • 2010 Balanced Multi-process Parallel Algorithm for Chemical Compound Inference with Given Path Frequencies in ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING
  • 2009 Chemical Compounds with Path Frequency Using Multi-Core Technology in SCALABLE INFORMATION SYSTEMS
  • 2007-12 Transcriptional regulation of human eosinophil RNases by an evolutionary- conserved sequence motif in primate genome in BMC MOLECULAR BIOLOGY
  • 2007 On the Diversity-Performance Relationship for Majority Voting in Classifier Ensembles in MULTIPLE CLASSIFIER SYSTEMS
  • 2007 3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction in PARALLEL COMPUTING TECHNOLOGIES
  • 2007 Approximation Algorithms for 2-Source Minimum Routing Cost k-Tree Problems in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS – ICCSA 2007
  • 2007 BioPortal: A Portal for Deployment of Bioinformatics Applications on Cluster and Grid Environments in HIGH PERFORMANCE COMPUTING FOR COMPUTATIONAL SCIENCE - VECPAR 2006
  • 2006-12 A reinforced merging methodology for mapping unique peptide motifs in members of protein families in BMC BIOINFORMATICS
  • 2006 An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR in FRONTIERS OF HIGH PERFORMANCE COMPUTING AND NETWORKING – ISPA 2006 WORKSHOPS
  • 2006 Efficient Algorithms for Regular Expression Constrained Sequence Alignment in COMBINATORIAL PATTERN MATCHING
  • 2006 The Bottleneck Tree Alignment Problems in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006
  • 2006 Comparative Gene Prediction Based on Gene Structure Conservation in PATTERN RECOGNITION IN BIOINFORMATICS
  • 2005 Modeling Signal Transduction of Neural System by Hybrid Petri Net Representation in OPERATIONS RESEARCH PROCEEDINGS 2004
  • 2005 A Fast Technique for Constructing Evolutionary Tree with the Application of Compact Sets in PARALLEL COMPUTING TECHNOLOGIES
  • 2005 Disjoint Segments with Maximum Density in COMPUTATIONAL SCIENCE – ICCS 2005
  • 2004 Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS – ICCSA 2004
  • 2003 On the Full and Bottleneck Full Steiner Tree Problems in COMPUTING AND COMBINATORICS
  • 2002-06-04 A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree in COMPUTING AND COMBINATORICS
  • 2002-06-04 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices in COMPUTING AND COMBINATORICS
  • 2002-04-12 Constructing Light Spanning Trees with Small Routing Cost in STACS 99
  • 2002 The Full Steiner Tree Problem in Phylogeny in COMPUTING AND COMBINATORICS
  • 2001-07-31 A New Measure of Edit Distance between Labeled Trees in COMPUTING AND COMBINATORICS
  • 2001-03-29 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems in ALGORITHMS AND COMPUTATION
  • 2000 Efficient Minus and Signed Domination in Graphs in ALGORITHMS AND COMPUTATION
  • 1999-07 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 1999-02 An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs in ACTA INFORMATICA
  • 1997 Efficient domination on permutation graphs and trapezoid graphs in COMPUTING AND COMBINATORICS
  • 1997 Edge and node searching problems on trees in COMPUTING AND COMBINATORICS
  • 1996 Graph searching on chordal graphs in ALGORITHMS AND COMPUTATION
  • 1992-12 Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs in ALGORITHMICA
  • 1992-03 An average case analysis of a resolution principle algorithm in mechanical theorem proving in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
  • 1991 An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm in ISA'91 ALGORITHMS
  • 1990 20-Relative neighborhood graphs are Hamiltonian in ALGORITHMS
  • 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": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
            "id": "", 
            "type": "Organization"
            "id": "", 
            "type": "Organization"
        "familyName": "Tang", 
        "givenName": "Chuan Yi", 
        "id": "sg:person.01312526135.27", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:46", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_505.json", 
        "type": "Person"

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


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

    curl -H 'Accept: application/ld+json' ''

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

    curl -H 'Accept: application/n-triples' ''

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' ''

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

    curl -H 'Accept: application/rdf+xml' ''


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