Kun Mao Chao


Ontology type: schema:Person     


Person Info

NAME

Kun Mao

SURNAME

Chao

Publications in SciGraph latest 50 shown

  • 2017-12 Data-driven interdisciplinary mathematical modelling quantitatively unveils competition dynamics of co-circulating influenza strains in JOURNAL OF TRANSLATIONAL MEDICINE
  • 2016 Maximum-Sum Segments in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Maximum-Average Segments in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Computing the Line-Constrained k-center in the Plane for Small k in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT
  • 2015 Maximum-Average Segments in ENCYCLOPEDIA OF ALGORITHMS
  • 2015 Maximum-Sum Segments in ENCYCLOPEDIA OF ALGORITHMS
  • 2015 Forming Plurality at Minimum Cost in WALCOM: ALGORITHMS AND COMPUTATION
  • 2014-12 Preface Algorithms and Computation (ISAAC 2012) in ALGORITHMICA
  • 2014-12 A fault-tolerant method for HLA typing with PacBio data in BMC BIOINFORMATICS
  • 2014 The Generalized Popular Condensation Problem in ALGORITHMS AND COMPUTATION
  • 2013-12 Risk factors for pulmonary tuberculosis in patients with chronic obstructive airway disease in Taiwan: a nationwide cohort study in BMC INFECTIOUS DISEASES
  • 2013-11 Urinary tuberculosis is associated with the development of urothelial carcinoma but not renal cell carcinoma: a nationwide cohort study in Taiwan in BRITISH JOURNAL OF CANCER
  • 2013-02 A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings in ALGORITHMICA
  • 2013 An Optimal Algorithm for the Popular Condensation Problem in COMBINATORIAL ALGORITHMS
  • 2013 Computing Plurality Points and Condorcet Points in Euclidean Space in ALGORITHMS AND COMPUTATION
  • 2013 A Compact and Efficient Labeling Scheme for XML Documents in DATABASE SYSTEMS FOR ADVANCED APPLICATIONS
  • 2012-10 In silico drug screening and potential target identification for hepatocellular carcinoma using support vector machine in BMC PROCEEDINGS
  • 2012 Preserving Inversion Phylogeny Reconstruction in ALGORITHMS IN BIOINFORMATICS
  • 2012 Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2011-04 On the generalized constrained longest common subsequence problems in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2011 Identifying Relevant Matches with NOT Semantics over XML Documents in DATABASE SYSTEMS FOR ADVANCED APPLICATIONS
  • 2010 Faster Algorithms for Searching Relevant Matches in XML Databases in DATABASE AND EXPERT SYSTEMS APPLICATIONS
  • 2010 Identifying Approximate Palindromes in Run-Length Encoded Strings in ALGORITHMS AND COMPUTATION
  • 2010 A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings in ALGORITHMS – ESA 2010
  • 2009-05 On Locating Disjoint Segments with Maximum Sum of Densities in ALGORITHMICA
  • 2009 Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard in COMBINATORIAL PATTERN MATCHING
  • 2009 Basic Algorithmic Techniques in SEQUENCE COMPARISON
  • 2009 Homology Search Tools in SEQUENCE COMPARISON
  • 2009 Introduction in SEQUENCE COMPARISON
  • 2009 Finding All Approximate Gapped Palindromes in ALGORITHMS AND COMPUTATION
  • 2009 Finding All Sorting Tandem Duplication Random Loss Operations in COMBINATORIAL PATTERN MATCHING
  • 2009 Anatomy of Spaced Seeds in SEQUENCE COMPARISON
  • 2009 Pairwise Sequence Alignment in SEQUENCE COMPARISON
  • 2009 Local Alignment Statistics in SEQUENCE COMPARISON
  • 2009 Scoring Matrices in SEQUENCE COMPARISON
  • 2009 Multiple Sequence Alignment in SEQUENCE COMPARISON
  • 2008-03 The Swap Edges of a Multiple-Sources Routing Tree in ALGORITHMICA
  • 2008 Maximum-scoring Segment with Length Restrictions in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 Minkowski Sum Selection and Finding in ALGORITHMS AND COMPUTATION
  • 2008 Maximum-Density Segment in ENCYCLOPEDIA OF ALGORITHMS
  • 2007 Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis in ALGORITHMS AND COMPUTATION
  • 2006 On Locating Disjoint Segments with Maximum Sum of Densities in ALGORITHMS AND COMPUTATION
  • 2005-12 Selecting additional tag SNPs for tolerating missing data in genotyping in BMC BIOINFORMATICS
  • 2005-03 Finding a Length-Constrained Maximum-Density Path in a Tree in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2005 Improved Algorithms for the k Maximum-Sums Problems in ALGORITHMS AND COMPUTATION
  • 2004 On the Range Maximum-Sum Segment Query Problem in ALGORITHMS AND COMPUTATION
  • 2004 Approximation Algorithms for the Selection of Robust Tag SNPs in ALGORITHMS IN BIOINFORMATICS
  • 2003 Finding a Length-Constrained Maximum-Density Path in a Tree in ALGORITHMS AND COMPUTATION
  • 2002-10-04 Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002
  • 2002-06-04 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices in COMPUTING AND COMBINATORICS
  • 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": "https://www.grid.ac/institutes/grid.19188.39", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.412550.7", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.29857.31", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.260770.4", 
            "type": "Organization"
          }
        ], 
        "familyName": "Chao", 
        "givenName": "Kun Mao", 
        "id": "sg:person.01063515113.26", 
        "identifier": {
          "name": "orcid_id", 
          "type": "PropertyValue", 
          "value": [
            "0000-0003-2837-1279"
          ]
        }, 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01063515113.26", 
          "https://orcid.org/0000-0003-2837-1279"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:50", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_565.json", 
        "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.01063515113.26'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    This table displays all metadata directly associated to this object as RDF triples.

    27 TRIPLES      11 PREDICATES      16 URIs      8 LITERALS      3 BLANK NODES

    Subject Predicate Object
    1 sg:person.01063515113.26 schema:affiliation Nc681e0782bf94373ae9714afe67ef846
    2 https://www.grid.ac/institutes/grid.260770.4
    3 https://www.grid.ac/institutes/grid.29857.31
    4 https://www.grid.ac/institutes/grid.412550.7
    5 schema:familyName Chao
    6 schema:givenName Kun Mao
    7 schema:identifier Nd8465502009d4874b5a7257819b67176
    8 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01063515113.26
    9 https://orcid.org/0000-0003-2837-1279
    10 schema:sdDatePublished 2019-03-07T14:50
    11 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    12 schema:sdPublisher N68c3ba07489348c7acdc16a8768fc669
    13 sgo:license sg:explorer/license/
    14 sgo:sdDataset persons
    15 rdf:type schema:Person
    16 N68c3ba07489348c7acdc16a8768fc669 schema:name Springer Nature - SN SciGraph project
    17 rdf:type schema:Organization
    18 Nc681e0782bf94373ae9714afe67ef846 schema:affiliation https://www.grid.ac/institutes/grid.19188.39
    19 sgo:isCurrent true
    20 rdf:type schema:OrganizationRole
    21 Nd8465502009d4874b5a7257819b67176 schema:name orcid_id
    22 schema:value 0000-0003-2837-1279
    23 rdf:type schema:PropertyValue
    24 https://www.grid.ac/institutes/grid.19188.39 schema:Organization
    25 https://www.grid.ac/institutes/grid.260770.4 schema:Organization
    26 https://www.grid.ac/institutes/grid.29857.31 schema:Organization
    27 https://www.grid.ac/institutes/grid.412550.7 schema:Organization
     




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


    ...