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/06", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Biological Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0604", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Genetics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, Texas, USA", 
          "id": "http://www.grid.ac/institutes/grid.267315.4", 
          "name": [
            "Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, Texas, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Stojanovic", 
        "givenName": "Nikola", 
        "id": "sg:person.01012555463.19", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01012555463.19"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania, USA", 
          "id": "http://www.grid.ac/institutes/grid.29857.31", 
          "name": [
            "Department of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania, 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"
      }
    ], 
    "datePublished": "2006", 
    "datePublishedReg": "2006-01-01", 
    "description": "The study of variation in DNA sequences, within the framework of phylogeny or population genetics, for instance, is one of the most important subjects in modern genomics. We here present a new linear-time algorithm for finding maximal k-regions in alignments of three sequences, which can be used for the detection of segments featuring a certain degree of similarity, as well as the boundaries of distinct genomic environments such as gene clusters or haplotype blocks. k-regions are defined as these which have a center sequence whose Hamming distance from any of the alignment rows is at most k, and their determination in the general case is known to be NP-hard.", 
    "editor": [
      {
        "familyName": "B\u00fccher", 
        "givenName": "Philipp", 
        "type": "Person"
      }, 
      {
        "familyName": "Moret", 
        "givenName": "Bernard M. E.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11851561_32", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-39583-6", 
        "978-3-540-39584-3"
      ], 
      "name": "Algorithms in Bioinformatics", 
      "type": "Book"
    }, 
    "keywords": [
      "genomic environment", 
      "gene cluster", 
      "population genetics", 
      "modern genomics", 
      "genetic variation", 
      "DNA sequences", 
      "haplotype blocks", 
      "center sequence", 
      "sequence", 
      "study of variation", 
      "phylogeny", 
      "genomics", 
      "genetics", 
      "variation", 
      "K region", 
      "similarity", 
      "clusters", 
      "alignment", 
      "segments", 
      "environment", 
      "certain degree", 
      "rows", 
      "study", 
      "distance", 
      "detection of segments", 
      "determination", 
      "degree", 
      "important subject", 
      "detection", 
      "block", 
      "instances", 
      "boundaries", 
      "linear time algorithm", 
      "NPs", 
      "framework", 
      "cases", 
      "new linear-time algorithm", 
      "Hamming distance", 
      "subjects", 
      "algorithm", 
      "general case"
    ], 
    "name": "A Linear-Time Algorithm for Studying Genetic Variation", 
    "pagination": "344-354", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1028212990"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11851561_32"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11851561_32", 
      "https://app.dimensions.ai/details/publication/pub.1028212990"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:20", 
    "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_429.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11851561_32"
  }
]

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.

115 TRIPLES      22 PREDICATES      66 URIs      59 LITERALS      7 BLANK NODES