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": "Dept. of Computer Science and Engineering, The Pennsylvania State University, USA", 
          "id": "http://www.grid.ac/institutes/grid.29857.31", 
          "name": [
            "Dept. of Computer Science and Engineering, The Pennsylvania State University, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Berman", 
        "givenName": "Piotr", 
        "id": "sg:person.01274506210.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01274506210.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Celera Genomics Co., 45 W. Gude Dr., 20350, Rockville, MD", 
          "id": "http://www.grid.ac/institutes/grid.418124.a", 
          "name": [
            "Celera Genomics Co., 45 W. Gude Dr., 20350, Rockville, MD"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Hannenhalli", 
        "givenName": "Sridhar", 
        "id": "sg:person.01341565477.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01341565477.18"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, University of Bonn, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Dept. of Computer Science, University of Bonn, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Karpinski", 
        "givenName": "Marek", 
        "id": "sg:person.011636042271.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011636042271.02"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2002-08-29", 
    "datePublishedReg": "2002-08-29", 
    "description": "Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals, MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations by reversals, and a polynomial time algorithm for a special case of unsigned permutations. The best known approximation algorithm for MIN-SBR, due to Christie, gives a performance ratio of 1.5. In this paper, by exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, we design a new 1.375-algorithm for the MIN-SBR problem.", 
    "editor": [
      {
        "familyName": "M\u00f6hring", 
        "givenName": "Rolf", 
        "type": "Person"
      }, 
      {
        "familyName": "Raman", 
        "givenName": "Rajeev", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45749-6_21", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-44180-9", 
        "978-3-540-45749-7"
      ], 
      "name": "Algorithms \u2014 ESA 2002", 
      "type": "Book"
    }, 
    "keywords": [
      "polynomial time algorithm", 
      "approximation algorithm", 
      "general combinatorial problems", 
      "time algorithm", 
      "first exact polynomial time algorithm", 
      "new approximation algorithm", 
      "exact polynomial-time algorithm", 
      "combinatorial problems", 
      "special case", 
      "cycle decomposition", 
      "minimum number", 
      "algorithm", 
      "permutations", 
      "breakpoint graph", 
      "problem", 
      "performance ratio", 
      "unsigned permutations", 
      "graph", 
      "Hannenhalli", 
      "Pevzner", 
      "inversion", 
      "decomposition", 
      "preliminary results", 
      "number", 
      "analysis of genomes", 
      "reversal", 
      "cases", 
      "results", 
      "analysis", 
      "series", 
      "ratio", 
      "Christie", 
      "genome", 
      "paper"
    ], 
    "name": "1.375-Approximation Algorithm for Sorting by Reversals", 
    "pagination": "200-210", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1016605518"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45749-6_21"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45749-6_21", 
      "https://app.dimensions.ai/details/publication/pub.1016605518"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:22", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_92.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-45749-6_21"
  }
]

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.

118 TRIPLES      22 PREDICATES      58 URIs      51 LITERALS      7 BLANK NODES