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": "Department of Computing and Software, McMaster University, L8S 4L7, Hamilton, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.25073.33", 
          "name": [
            "Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada", 
            "Department of Computing and Software, McMaster University, L8S 4L7, Hamilton, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lin", 
        "givenName": "Guo-Hui", 
        "id": "sg:person.01130357621.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01130357621.02"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, 350-0394, Saitama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, 350-0394, Saitama, 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": "Department of Computer Science, University of California, 92521, Riverside, CA", 
          "id": "http://www.grid.ac/institutes/grid.266097.c", 
          "name": [
            "Department of Computing and Software, McMaster University, L8S 4L7, Hamilton, Ontario, Canada", 
            "Department of Computer Science, University of California, 92521, Riverside, CA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jiang", 
        "givenName": "Tao", 
        "id": "sg:person.015107424575.17", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015107424575.17"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of California, 92521, Riverside, CA", 
          "id": "http://www.grid.ac/institutes/grid.266097.c", 
          "name": [
            "Department of Computer Science, University of California, 92521, Riverside, CA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wen", 
        "givenName": "Jianjun", 
        "id": "sg:person.013667114745.67", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013667114745.67"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2001-07-04", 
    "datePublishedReg": "2001-07-04", 
    "description": "Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The LONGEST ARC- PRESERVING COMMON SUBSEQUENCE (LAPCS) Problem has been introduced in [11] as a framework for studying the similarity of arc-annotated sequences. Several algorithmic and complexity results on the LAPCS problem have been presented in [1117]. In this paper, we continue this line of research and present new algorithmic and complexity results on the LAPCS problem restricted to two nested arc-annotated sequences, denoted as LAPCS(NESTED, NESTED). The restricted problem is perhaps the most interesting variant of the LAPCS problem and has important applications in the comparison of RNA secondary and tertiary structures. Particularly, we prove that LAPCS(NESTED, NESTED) is NP-hard, which answers an open question in [11]. We then present a polynomial-time approximation scheme for LAPCS(NESTED, NESTED) with an additional c- diagonal restriction. An interesting special case, upunary LAPCS(NESTED, NESTED), is also investigated.", 
    "editor": [
      {
        "familyName": "Orejas", 
        "givenName": "Fernando", 
        "type": "Person"
      }, 
      {
        "familyName": "Spirakis", 
        "givenName": "Paul G.", 
        "type": "Person"
      }, 
      {
        "familyName": "van Leeuwen", 
        "givenName": "Jan", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-48224-5_37", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-42287-7", 
        "978-3-540-48224-6"
      ], 
      "name": "Automata, Languages and Programming", 
      "type": "Book"
    }, 
    "keywords": [
      "arc-annotated sequences", 
      "common subsequence problem", 
      "complexity results", 
      "subsequence problem", 
      "polynomial time approximation scheme", 
      "longest common subsequence problem", 
      "diagonal restriction", 
      "important applications", 
      "interesting variant", 
      "approximation scheme", 
      "interesting special cases", 
      "line of research", 
      "structural information", 
      "annotation", 
      "protein sequences", 
      "NPs", 
      "scheme", 
      "framework", 
      "special case", 
      "information", 
      "open question", 
      "applications", 
      "sequence", 
      "similarity", 
      "results", 
      "research", 
      "variants", 
      "restriction", 
      "comparison", 
      "questions", 
      "structure", 
      "cases", 
      "lines", 
      "tertiary structure", 
      "Comparison of RNA", 
      "RNA", 
      "problem", 
      "paper"
    ], 
    "name": "The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations", 
    "pagination": "444-455", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027497758"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-48224-5_37"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-48224-5_37", 
      "https://app.dimensions.ai/details/publication/pub.1027497758"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:49", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_59.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-48224-5_37"
  }
]

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.

137 TRIPLES      23 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES