Louxin Zhang


Ontology type: schema:Person     


Person Info

NAME

Louxin

SURNAME

Zhang

Publications in SciGraph latest 50 shown

  • 2017-12 Improved anticancer drug response prediction in cell lines using matrix factorization with similarity regularization in BMC CANCER
  • 2017-03 A program to compute the soft Robinson–Foulds distance between phylogenetic networks in BMC GENOMICS
  • 2016-05 Predicting chemotherapeutic drug combinations through gene network profiling in SCIENTIFIC REPORTS
  • 2016 Superiority and Complexity of the Spaced Seeds in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2016 Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time in COMBINATORIAL ALGORITHMS
  • 2015-07 Fitness Profiling Links Topoisomerase II Regulation of Centromeric Integrity to Doxorubicin Resistance in Fission Yeast in SCIENTIFIC REPORTS
  • 2015 Locating a Tree in a Phylogenetic Network in Quadratic Time in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2015 Superiority and Complexity of the Spaced Seeds in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2014 Reconciliation with Non-binary Gene Trees Revisited in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2013-12 Counting motifs in the human interactome in NATURE COMMUNICATIONS
  • 2013 Counting Motifs in the Entire Biological Network from Noisy and Incomplete Data in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2013 Computing Distances Between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 2013 A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2013 Effect of Incomplete Lineage Sorting on Tree-Reconciliation-Based Inference of Gene Duplication in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2013 A Tool for Non-binary Tree Reconciliation in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2012-12 Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry in BMC SYSTEMS BIOLOGY
  • 2012 Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2011-12 Conversion events in gene clusters in BMC EVOLUTIONARY BIOLOGY
  • 2011-12 Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree in BMC BIOINFORMATICS
  • 2011-05 Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2011 A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2010-10-04 Modern BLAST Programs in PROBLEM SOLVING HANDBOOK IN COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
  • 2010-10 Analyzing the Fitch Method for Reconstructing Ancestral States on Ultrametric Phylogenetic Trees in BULLETIN OF MATHEMATICAL BIOLOGY
  • 2010 An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation in ALGORITHMS IN BIOINFORMATICS
  • 2009-12 Positive correlation between gene coexpression and positional clustering in the zebrafish genome in BMC GENOMICS
  • 2009 Approximating the Spanning k-Tree Forest Problem in FRONTIERS IN ALGORITHMICS
  • 2009 Inferring the Recent Duplication History of a Gene Cluster in COMPARATIVE GENOMICS
  • 2008-09 A stable iterative method for refining discriminative gene clusters in BMC GENOMICS
  • 2008 Nearest Neighbor Interchange and Related Distances in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance in FRONTIERS IN ALGORITHMICS
  • 2007-07 The Consecutive Ones Submatrix Problem for Sparse Matrices in ALGORITHMICA
  • 2007-06 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis in ALGORITHMICA
  • 2007 A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications in COMPARATIVE GENOMICS
  • 2006 Procrastination Leads to Efficient Filtration for Local Multiple Alignment in ALGORITHMS IN BIOINFORMATICS
  • 2006 Controlling Size When Aligning Multiple Genomic Sequences with Duplications in ALGORITHMS IN BIOINFORMATICS
  • 2005-12 Genome-scale analysis of positional clustering of mouse testis-specific genes in BMC GENOMICS
  • 2005 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis in COMPUTING AND COMBINATORICS
  • 2004 Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices in ALGORITHMS AND COMPUTATION
  • 2004 Translation Initiation Sites Prediction with Mixture Gaussian Models in ALGORITHMS IN BIOINFORMATICS
  • 2002-10-10 Efficient Methods for Inferring Tandem Duplication History in ALGORITHMS IN BIOINFORMATICS
  • 1999-07 Fitting Distances by Tree Metrics with Increment Error in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 1998 Computing Distances between Evolutionary Trees in HANDBOOK OF COMBINATORIAL OPTIMIZATION
  • 1996 Some notes on the nearest neighbour interchange distance in COMPUTING AND COMBINATORICS
  • 1995 Small weight bases for hamming codes in COMPUTING AND COMBINATORICS
  • 1991-05 Decision problems for finite special string-rewriting systems that are confluent on some congruence class in ACTA INFORMATICA
  • 1986-12 Rational strong codes and structure of rational group languages in SEMIGROUP FORUM
  • 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.4280.e", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.32566.34", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.46078.3d", 
            "type": "Organization"
          }
        ], 
        "familyName": "Zhang", 
        "givenName": "Louxin", 
        "id": "sg:person.012763757651.13", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012763757651.13"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:25", 
        "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_1214.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.012763757651.13'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...