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"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Algorithms", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Computational Biology", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Computer Simulation", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Hybridization, Genetic", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Phylogeny", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Poaceae", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Software", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Division of Information System Design, Tokyo Denki University, Ishizaka, Hatoyama, 359-0394, Hiki, Saitama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Division of Information System Design, Tokyo Denki University, Ishizaka, Hatoyama, 359-0394, Hiki, 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, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong", 
          "id": "http://www.grid.ac/institutes/grid.35030.35", 
          "name": [
            "Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong"
          ], 
          "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"
      }, 
      {
        "affiliation": {
          "alternateName": "Division of Information System Design, Tokyo Denki University, Ishizaka, Hatoyama, 359-0394, Hiki, Saitama, Japan", 
          "id": "http://www.grid.ac/institutes/grid.412773.4", 
          "name": [
            "Division of Information System Design, Tokyo Denki University, Ishizaka, Hatoyama, 359-0394, Hiki, Saitama, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Yamanaka", 
        "givenName": "Satoshi", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/s00285-005-0315-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004690562", 
          "https://doi.org/10.1007/s00285-005-0315-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-13078-6_23", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026208880", 
          "https://doi.org/10.1007/978-3-642-13078-6_23"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1186/1471-2148-10-42", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1017964138", 
          "https://doi.org/10.1186/1471-2148-10-42"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1186/1471-2148-6-15", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031420454", 
          "https://doi.org/10.1186/1471-2148-6-15"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00026-004-0229-z", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049592483", 
          "https://doi.org/10.1007/s00026-004-0229-z"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1186/1471-2105-9-532", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020382975", 
          "https://doi.org/10.1186/1471-2105-9-532"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-13193-6_13", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021203456", 
          "https://doi.org/10.1007/978-3-642-13193-6_13"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1186/1471-2105-8-460", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050692349", 
          "https://doi.org/10.1186/1471-2105-8-460"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2012-07-02", 
    "datePublishedReg": "2012-07-02", 
    "description": "BackgroundDue to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to combine the two phylogenetic trees into a hybridization network with the fewest hybridization events. This leads to three computational problems, namely, the problem of computing the minimum size of a hybridization network, the problem of constructing one minimum hybridization network, and the problem of enumerating a representative set of minimum hybridization networks. The previously best software tools for these problems (namely, Chen and Wang\u2019s HybridNet and Albrecht et al.\u2019s Dendroscope 3) run very slowly for large instances that cannot be reduced to relatively small instances. Indeed, when the minimum size of a hybridization network of two given trees is larger than 23 and the problem for the trees cannot be reduced to relatively smaller independent subproblems, then HybridNet almost always takes longer than 1 day and Dendroscope 3 often fails to complete. Thus, a faster software tool for the problems is in need.ResultsWe develop a software tool in ANSI C, named FastHN, for the following problems: Computing the minimum size of a hybridization network, constructing one minimum hybridization network, and enumerating a representative set of minimum hybridization networks. We obtain FastHN by refining HybridNet with three ideas. The first idea is to preprocess the input trees so that the trees become smaller or the problem becomes to solve two or more relatively smaller independent subproblems. The second idea is to use a fast algorithm for computing the rSPR distance of two given phylognetic trees to cut more branches of the search tree in the exhaustive-search stage of the algorithm. The third idea is that during the exhaustive-search stage of the algorithm, we find two sibling leaves in one of the two forests (obtained from the given trees by cutting some edges) such that they are as far as possible in the other forest. As the result, FastHN always runs much faster than HybridNet. Unlike Dendroscope 3, FastHN is a single-threaded program. Despite this disadvantage, our experimental data shows that FastHN runs substantially faster than the multi-threaded Dendroscope 3 on a PC with multiple cores. Indeed, FastHN can finish within 16 minutes (on average on a Windows-7 (x64) desktop PC with i7-2600 CPU) even if the minimum size of a hybridization network of two given trees is about 25, the trees each have 100 leaves, and the problem for the input trees cannot be reduced to two or more independent subproblems via cluster reductions. It is also worth mentioning that like HybridNet, FastHN does not use much memory (indeed, the amount of memory is at most quadratic in the input size). In contrast, Dendroscope 3 uses a huge amount of memory. Executables of FastHN for Windows XP (x86), Windows 7 (x64), Linux, and Mac OS are available (see the Results and discussion section for details).ConclusionsFor both biological datasets and simulated datasets, our experimental results show that FastHN runs substantially faster than HybridNet and Dendroscope 3. The superiority of FastHN in speed over the previous tools becomes more significant as the hybridization number becomes larger. In addition, FastHN uses much less memory than Dendroscope 3 and uses the same amount of memory as HybridNet.", 
    "genre": "article", 
    "id": "sg:pub.10.1186/1471-2105-13-155", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.6078852", 
        "type": "MonetaryGrant"
      }, 
      {
        "id": "sg:grant.7427614", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1023786", 
        "issn": [
          "1471-2105"
        ], 
        "name": "BMC Bioinformatics", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "13"
      }
    ], 
    "keywords": [
      "minimum hybridization networks", 
      "software tools", 
      "smaller independent subproblems", 
      "independent subproblems", 
      "hybridization networks", 
      "better software tools", 
      "input trees", 
      "ANSI C", 
      "fast software tool", 
      "Mac OS", 
      "Windows XP", 
      "search tree", 
      "Windows 7", 
      "representative set", 
      "hybridization number", 
      "less memory", 
      "computational problems", 
      "small instances", 
      "multiple cores", 
      "large instances", 
      "HybridNet", 
      "huge amount", 
      "set of species", 
      "biological datasets", 
      "fast algorithm", 
      "previous tools", 
      "rSPR distance", 
      "network", 
      "phylogenetic tree", 
      "algorithm", 
      "subproblems", 
      "hybridization events", 
      "experimental results", 
      "second idea", 
      "dataset", 
      "first idea", 
      "different phylogenetic trees", 
      "minimum size", 
      "set", 
      "fast tool", 
      "tool", 
      "Linux", 
      "executables", 
      "memory", 
      "trees", 
      "different genes", 
      "instances", 
      "experimental data show", 
      "idea", 
      "third idea", 
      "problem", 
      "PC", 
      "leaves", 
      "species", 
      "data show", 
      "XP", 
      "superiority", 
      "forest", 
      "more branches", 
      "genes", 
      "speed", 
      "OS", 
      "amount", 
      "disadvantages", 
      "need", 
      "results", 
      "show", 
      "size", 
      "number", 
      "stage", 
      "distance", 
      "program", 
      "evolution", 
      "core", 
      "branches", 
      "events", 
      "same amount", 
      "cluster reduction", 
      "cases", 
      "contrast", 
      "addition", 
      "ResultsWe", 
      "reduction", 
      "days", 
      "minutes", 
      "BackgroundDue", 
      "ConclusionsFor"
    ], 
    "name": "A fast tool for minimum hybridization networks", 
    "pagination": "155", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1013236358"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1186/1471-2105-13-155"
        ]
      }, 
      {
        "name": "pubmed_id", 
        "type": "PropertyValue", 
        "value": [
          "22748099"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1186/1471-2105-13-155", 
      "https://app.dimensions.ai/details/publication/pub.1013236358"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:27", 
    "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/article/article_571.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1186/1471-2105-13-155"
  }
]

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.

232 TRIPLES      22 PREDICATES      129 URIs      112 LITERALS      14 BLANK NODES