Ming Li


Ontology type: schema:Person     


Person Info

NAME

Ming

SURNAME

Li

Publications in SciGraph latest 50 shown

  • 2019-01 Deep learning enables de novo peptide sequencing from data-independent-acquisition mass spectrometry in NATURE METHODS
  • 2016-10 Complete De Novo Assembly of Monoclonal Antibody Sequences in SCIENTIFIC REPORTS
  • 2016 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2014-11 Merge-Weighted Dynamic Time Warping for Speech Recognition in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2014-02 Estimating feature ratings through an effective review selection approach in KNOWLEDGE AND INFORMATION SYSTEMS
  • 2014 Closest String and Substring Problems in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2013-12 Protein Structure Idealization: How accurately is it possible to model protein structures with dihedral angles? in ALGORITHMS FOR MOLECULAR BIOLOGY
  • 2013 Computing Distances Between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 2013 Towards Reliable Automatic Protein Structure Alignment in ALGORITHMS IN BIOINFORMATICS
  • 2012-12 Combining automated peak tracking in SAR by NMR with structure-based backbone assignment from 15N-NOESY in BMC BIOINFORMATICS
  • 2012 LoopWeaver – Loop Modeling by the Weighted Scaling of Verified Proteins in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2012 How Accurately Can We Model Protein Structures with Dihedral Angles? in ALGORITHMS IN BIOINFORMATICS
  • 2012 Protein Structure by Semidefinite Facial Reduction in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2011-01 A New Multiword Expression Metric and Its Applications in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2010-07 A New Approach for Multi-Document Update Summarization in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2010 Towards Automated Structure-Based NMR Resonance Assignment in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2010-01 Preface in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2010-01 Can We Determine a Protein Structure Quickly? in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2009-12 Improving consensus contact prediction via server correlation reduction in BMC STRUCTURAL BIOLOGY
  • 2009 Normalized Information Distance in INFORMATION THEORY AND STATISTICAL LEARNING
  • 2008-07 New Information Distance Measure and Its Application in Question Answering System in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2008 Finding Largest Well-Predicted Subset of Protein Structure Models in COMBINATORIAL PATTERN MATCHING
  • 2008 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 Rapid and Accurate Protein Side Chain Prediction with Local Backbone Information in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2007 Finding Compact Structural Motifs in COMBINATORIAL PATTERN MATCHING
  • 2006 On the Complexity of the Crossing Contact Map Pattern Matching Problem in ALGORITHMS IN BIOINFORMATICS
  • 2005-06-21 Average-case analysis via incompressibility in FUNDAMENTALS OF COMPUTATION THEORY
  • 2005 A New Algorithm for Pattern Optimization in Protein-Protein Interaction Extraction System in PATTERN RECOGNITION AND IMAGE ANALYSIS
  • 2004-03 A note on the single genotype resolution problem in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2004 Optimizing Multiple Spaced Seeds for Homology Search in COMBINATORIAL PATTERN MATCHING
  • 2004 On the k-Closest Substring and k-Consensus Pattern Problems in COMBINATORIAL PATTERN MATCHING
  • 2003 Pattern Discovery in INTRODUCTION TO BIOINFORMATICS
  • 2002-01-18 New Applications of the Incompressibility Method (Extended Abstract) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002-01-18 Average-Case Complexity of Shellsort (Preliminary Version) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Sharpening Occam’s Razor in COMPUTING AND COMBINATORICS
  • 2000-09 Average-case analysis of algorithms using Kolmogorov complexity in JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
  • 2000 The Incompressibility Method in SOFSEM 2000: THEORY AND PRACTICE OF INFORMATICS
  • 1999-06 On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees in ALGORITHMICA
  • 1998 Computing Distances between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 1997-09 The miraculous universal distribution in THE MATHEMATICAL INTELLIGENCER
  • 1997 On prediction by data compression in MACHINE LEARNING: ECML-97
  • 1997 Average-Case Analysis Using Kolmogorov Complexity in ADVANCES IN ALGORITHMS, LANGUAGES, AND COMPLEXITY
  • 1996-08 DNA sequencing and string learning in MATHEMATICAL SYSTEMS THEORY
  • 1996 Some notes on the nearest neighbour interchange distance in COMPUTING AND COMBINATORICS
  • 1995 Lower bounds on learning decision lists and trees in STACS 95
  • 1995 Inferring a DNA sequence from erroneous copies (abstract) in ALGORITHMIC LEARNING THEORY
  • 1995 Computational machine learning in theory and praxis in COMPUTER SCIENCE TODAY
  • 1995 Algorithmic arguments in physics of computation in ALGORITHMS AND DATA STRUCTURES
  • 1994-07 Statistical properties of finite sequences with high Kolmogorov complexity in MATHEMATICAL SYSTEMS THEORY
  • 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.46078.3d", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.12527.33", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.133342.4", 
            "type": "Organization"
          }
        ], 
        "familyName": "Li", 
        "givenName": "Ming", 
        "id": "sg:person.0621576316.79", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0621576316.79"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:59", 
        "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_690.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.0621576316.79'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...