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", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chen", 
        "givenName": "Zhi-Zhong", 
        "id": "sg:person.015654265661.98", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015654265661.98"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Harada", 
        "givenName": "Youta", 
        "id": "sg:person.011526465541.54", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011526465541.54"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Division of Information System Design, Tokyo Denki University, 350-0394, Saitama, Hatoyama, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Machida", 
        "givenName": "Eita", 
        "id": "sg:person.014542220455.48", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014542220455.48"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "School of Computer Science and Technology, Tianjin University, Tianjin, China", 
          "id": "http://www.grid.ac/institutes/grid.33763.32", 
          "name": [
            "School of Computer Science and Technology, Tianjin University, Tianjin, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Guo", 
        "givenName": "Fei", 
        "id": "sg:person.0776100512.16", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0776100512.16"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong SAR", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong SAR"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wang", 
        "givenName": "Lusheng", 
        "id": "sg:person.01105113721.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01105113721.52"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2016-05-27", 
    "datePublishedReg": "2016-05-27", 
    "description": "Scaffolding is one of the main stages in genome assembly. During this stage, we want to merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For this purpose, the following graph-theoretical problem has been proposed: Given an edge-weighted complete graph G and a perfect matching D of G, we wish to find a Hamiltonian path P in G such that all edges of D appear in P and the total weight of edges in P but not in D is maximized. This problem is NP-hard and the previously best polynomial-time approximation algorithm for it achieves a ratio of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${\\frac{1}{2}}$$\\end{document}. In this paper, we design a new polynomial-time approximation algorithm achieving a ratio of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$${\\frac{5-5{\\epsilon }}{9-8{\\epsilon }}}$$\\end{document} for any constant \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$0< {\\epsilon } < 1$$\\end{document}. Several generalizations of the problem have also been introduced in the literature and we present polynomial-time approximation algorithms for them that achieve better approximation ratios than the previous bests. In particular, one of the algorithms answers an open question.", 
    "editor": [
      {
        "familyName": "Zhu", 
        "givenName": "Daming", 
        "type": "Person"
      }, 
      {
        "familyName": "Bereg", 
        "givenName": "Sergey", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-39817-4_3", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-319-39816-7", 
        "978-3-319-39817-4"
      ], 
      "name": "Frontiers in Algorithmics", 
      "type": "Book"
    }, 
    "keywords": [
      "polynomial-time approximation algorithm", 
      "approximation algorithm", 
      "best polynomial-time approximation algorithm", 
      "graph theoretical problem", 
      "new polynomial-time approximation algorithm", 
      "best approximation algorithm", 
      "best approximation ratio", 
      "Hamiltonian path P", 
      "Scaffolding Problem", 
      "previous bests", 
      "approximation ratio", 
      "graph G", 
      "big chains", 
      "path P", 
      "algorithm", 
      "problem", 
      "complete graph G", 
      "open question", 
      "generalization", 
      "edge", 
      "NPs", 
      "total weight", 
      "main stages", 
      "BEST", 
      "ratio", 
      "chain", 
      "literature", 
      "paired-end reads", 
      "questions", 
      "purpose", 
      "genome assembly", 
      "reads", 
      "stage", 
      "weight", 
      "scaffolding", 
      "assembly", 
      "contigs", 
      "scaffolds", 
      "paper"
    ], 
    "name": "Better Approximation Algorithms for Scaffolding Problems", 
    "pagination": "17-28", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1022958113"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-39817-4_3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-39817-4_3", 
      "https://app.dimensions.ai/details/publication/pub.1022958113"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:48", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_332.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-39817-4_3"
  }
]

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

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

138 TRIPLES      23 PREDICATES      64 URIs      57 LITERALS      7 BLANK NODES