Chin Lung Lu

Ontology type: schema:Person     

Person Info


Chin Lung



Publications in SciGraph latest 50 shown

  • 2018-12 Multi-CSAR: a multiple reference-based contig scaffolder using algebraic rearrangements in BMC SYSTEMS BIOLOGY
  • 2017-12 R3D-BLAST2: an improved search tool for similar RNA 3D substructures in BMC BIOINFORMATICS
  • 2016-12 Multi-CAR: a tool of contig scaffolding using multiple references in BMC BIOINFORMATICS
  • 2015 Sorting by Transpositions and Reversals (Approximate Ratio 1.5) in ENCYCLOPEDIA OF ALGORITHMS
  • 2014-12 CAR: contig assembly of prokaryotic draft genomes using rearrangements in BMC BIOINFORMATICS
  • 2013-04 Assembling contigs in draft genomes using reversals and block-interchanges in BMC BIOINFORMATICS
  • 2013 An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance in COMPUTING AND COMBINATORICS
  • 2013 A New Filtration Method and a Hybrid Strategy for Approximate String Matching in ADVANCES IN INTELLIGENT SYSTEMS AND APPLICATIONS - VOLUME 1
  • 2011-12 Sorting permutations by cut-circularize-linearize-and-paste operations in BMC GENOMICS
  • 2010-12 Reconstructing genome trees of prokaryotes using overlapping genes in BMC BIOINFORMATICS
  • 2008 Sorting by Transpositions and Reversals (Approximate Ratio 1.5) in ENCYCLOPEDIA OF ALGORITHMS
  • 2006-12 Analysis of circular genome rearrangement by fusions, fissions and block-interchanges in BMC BIOINFORMATICS
  • 2006 Efficient Algorithms for Regular Expression Constrained Sequence Alignment in COMBINATORIAL PATTERN MATCHING
  • 2004-12 Evolutionary Analysis of the Two-Component Systems in Pseudomonas aeruginosa PAO1 in JOURNAL OF MOLECULAR EVOLUTION
  • 2003 On the Full and Bottleneck Full Steiner Tree Problems in COMPUTING AND COMBINATORICS
  • 2002-01-29 An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree in ALGORITHMS AND COMPUTATION
  • 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
  • 2000 Efficient Minus and Signed Domination in Graphs in ALGORITHMS AND COMPUTATION
  • 1997 Efficient domination on permutation graphs and trapezoid graphs 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": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
            "id": "", 
            "type": "Organization"
            "id": "", 
            "type": "Organization"
        "familyName": "Lu", 
        "givenName": "Chin Lung", 
        "id": "sg:person.016502771037.22", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:52", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1636.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)