An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1984-05

AUTHORS

Neal L. Oden, Kwang-Tsao Shao

ABSTRACT

A computer algorithm is presented which equiprobably generates any member of the set of all directed trees withk labeled terminal nodes and unlabeled interior nodes. The algorithm requires roughlyk2/2 storage locations. The one-time initialization requiresO(k2) time, while generating each tree requiresO(k) time.

PAGES

379-387

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf02462013

DOI

http://dx.doi.org/10.1007/bf02462013

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1047493839

PUBMED

https://www.ncbi.nlm.nih.gov/pubmed/6547358


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Biological Evolution", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Models, Biological", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Probability", 
        "type": "DefinedTerm"
      }, 
      {
        "inDefinedTermSet": "https://www.nlm.nih.gov/mesh/", 
        "name": "Software", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Stony Brook University", 
          "id": "https://www.grid.ac/institutes/grid.36425.36", 
          "name": [
            "Department of Ecology and Evolution, State University of New York at Stony Brook, 11794, Stony Brook, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Oden", 
        "givenName": "Neal L.", 
        "id": "sg:person.01025142664.99", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01025142664.99"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Stony Brook University", 
          "id": "https://www.grid.ac/institutes/grid.36425.36", 
          "name": [
            "Department of Ecology and Evolution, State University of New York at Stony Brook, 11794, Stony Brook, NY, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shao", 
        "givenName": "Kwang-Tsao", 
        "id": "sg:person.0663713637.66", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0663713637.66"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf02459385", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004462758", 
          "https://doi.org/10.1007/bf02459385"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf02459385", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004462758", 
          "https://doi.org/10.1007/bf02459385"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-69024-2_20", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007820636", 
          "https://doi.org/10.1007/978-3-642-69024-2_20"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/322169.322171", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025755713"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/359423.359434", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031866364"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1038/297197a0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036488138", 
          "https://doi.org/10.1038/297197a0"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/322169.322170", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044068739"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bfb0091818", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048594408", 
          "https://doi.org/10.1007/bfb0091818"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1016/s0092-8240(83)80039-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1054614600", 
          "https://doi.org/10.1016/s0092-8240(83)80039-1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2412810", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069921180"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2412969", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069921317"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2413252", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069921539"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2413254", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069921541"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1984-05", 
    "datePublishedReg": "1984-05-01", 
    "description": "A computer algorithm is presented which equiprobably generates any member of the set of all directed trees withk labeled terminal nodes and unlabeled interior nodes. The algorithm requires roughlyk2/2 storage locations. The one-time initialization requiresO(k2) time, while generating each tree requiresO(k) time.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf02462013", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1018370", 
        "issn": [
          "0092-8240", 
          "1522-9602"
        ], 
        "name": "Bulletin of Mathematical Biology", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "3", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "46"
      }
    ], 
    "name": "An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes", 
    "pagination": "379-387", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "e23ec988661894d1f94ddc9052f05c32bc50170dfcb6c91465deb9148a92e225"
        ]
      }, 
      {
        "name": "pubmed_id", 
        "type": "PropertyValue", 
        "value": [
          "6547358"
        ]
      }, 
      {
        "name": "nlm_unique_id", 
        "type": "PropertyValue", 
        "value": [
          "0401404"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02462013"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047493839"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02462013", 
      "https://app.dimensions.ai/details/publication/pub.1047493839"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T13:29", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000370_0000000370/records_46744_00000002.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2FBF02462013"
  }
]
 

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf02462013'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf02462013'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02462013'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02462013'


 

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

137 TRIPLES      21 PREDICATES      46 URIs      26 LITERALS      14 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02462013 schema:about N3befb6b455214a24890dd6bea86847ba
2 N7cc04917140b4ca6bf78e23d1d790080
3 N8ca0586bf56049488d04316d6509ad47
4 N997f56835beb4618be76dd97c4f27551
5 Nb2570faa611d4adfaaed2f93f19cc767
6 anzsrc-for:08
7 anzsrc-for:0801
8 schema:author N83c3a4bf34ce4a0d9b51ef3010478051
9 schema:citation sg:pub.10.1007/978-3-642-69024-2_20
10 sg:pub.10.1007/bf02459385
11 sg:pub.10.1007/bfb0091818
12 sg:pub.10.1016/s0092-8240(83)80039-1
13 sg:pub.10.1038/297197a0
14 https://doi.org/10.1145/322169.322170
15 https://doi.org/10.1145/322169.322171
16 https://doi.org/10.1145/359423.359434
17 https://doi.org/10.2307/2412810
18 https://doi.org/10.2307/2412969
19 https://doi.org/10.2307/2413252
20 https://doi.org/10.2307/2413254
21 schema:datePublished 1984-05
22 schema:datePublishedReg 1984-05-01
23 schema:description A computer algorithm is presented which equiprobably generates any member of the set of all directed trees withk labeled terminal nodes and unlabeled interior nodes. The algorithm requires roughlyk2/2 storage locations. The one-time initialization requiresO(k2) time, while generating each tree requiresO(k) time.
24 schema:genre research_article
25 schema:inLanguage en
26 schema:isAccessibleForFree false
27 schema:isPartOf Na71c7ee5b4664c5c96f708c95194770e
28 Nc7fd30c74a634e0faf6bf701983c5390
29 sg:journal.1018370
30 schema:name An algorithm to equiprobably generate all directed trees withk labeled terminal nodes and unlabeled interior nodes
31 schema:pagination 379-387
32 schema:productId N3bed3dbac0cd46d1a30a221f62108fea
33 N3f8744feb0da4ebdad9338eb019995a7
34 Nacf8d4c3864643e9a2c6c023d13e06fb
35 Nbf61198539a74cc9814fbfa78ce35333
36 Nc2d7e2235f3b44aeaab29c8d25627375
37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047493839
38 https://doi.org/10.1007/bf02462013
39 schema:sdDatePublished 2019-04-11T13:29
40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
41 schema:sdPublisher Nac2caa27c59a4445a38df2b609982e1b
42 schema:url http://link.springer.com/10.1007%2FBF02462013
43 sgo:license sg:explorer/license/
44 sgo:sdDataset articles
45 rdf:type schema:ScholarlyArticle
46 N3bed3dbac0cd46d1a30a221f62108fea schema:name doi
47 schema:value 10.1007/bf02462013
48 rdf:type schema:PropertyValue
49 N3befb6b455214a24890dd6bea86847ba schema:inDefinedTermSet https://www.nlm.nih.gov/mesh/
50 schema:name Software
51 rdf:type schema:DefinedTerm
52 N3f8744feb0da4ebdad9338eb019995a7 schema:name pubmed_id
53 schema:value 6547358
54 rdf:type schema:PropertyValue
55 N7cc04917140b4ca6bf78e23d1d790080 schema:inDefinedTermSet https://www.nlm.nih.gov/mesh/
56 schema:name Biological Evolution
57 rdf:type schema:DefinedTerm
58 N83c3a4bf34ce4a0d9b51ef3010478051 rdf:first sg:person.01025142664.99
59 rdf:rest Nb3d29bebe60846a7ac76db6df5a2eaec
60 N8ca0586bf56049488d04316d6509ad47 schema:inDefinedTermSet https://www.nlm.nih.gov/mesh/
61 schema:name Models, Biological
62 rdf:type schema:DefinedTerm
63 N997f56835beb4618be76dd97c4f27551 schema:inDefinedTermSet https://www.nlm.nih.gov/mesh/
64 schema:name Mathematics
65 rdf:type schema:DefinedTerm
66 Na71c7ee5b4664c5c96f708c95194770e schema:volumeNumber 46
67 rdf:type schema:PublicationVolume
68 Nac2caa27c59a4445a38df2b609982e1b schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 Nacf8d4c3864643e9a2c6c023d13e06fb schema:name readcube_id
71 schema:value e23ec988661894d1f94ddc9052f05c32bc50170dfcb6c91465deb9148a92e225
72 rdf:type schema:PropertyValue
73 Nb2570faa611d4adfaaed2f93f19cc767 schema:inDefinedTermSet https://www.nlm.nih.gov/mesh/
74 schema:name Probability
75 rdf:type schema:DefinedTerm
76 Nb3d29bebe60846a7ac76db6df5a2eaec rdf:first sg:person.0663713637.66
77 rdf:rest rdf:nil
78 Nbf61198539a74cc9814fbfa78ce35333 schema:name dimensions_id
79 schema:value pub.1047493839
80 rdf:type schema:PropertyValue
81 Nc2d7e2235f3b44aeaab29c8d25627375 schema:name nlm_unique_id
82 schema:value 0401404
83 rdf:type schema:PropertyValue
84 Nc7fd30c74a634e0faf6bf701983c5390 schema:issueNumber 3
85 rdf:type schema:PublicationIssue
86 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
87 schema:name Information and Computing Sciences
88 rdf:type schema:DefinedTerm
89 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
90 schema:name Artificial Intelligence and Image Processing
91 rdf:type schema:DefinedTerm
92 sg:journal.1018370 schema:issn 0092-8240
93 1522-9602
94 schema:name Bulletin of Mathematical Biology
95 rdf:type schema:Periodical
96 sg:person.01025142664.99 schema:affiliation https://www.grid.ac/institutes/grid.36425.36
97 schema:familyName Oden
98 schema:givenName Neal L.
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01025142664.99
100 rdf:type schema:Person
101 sg:person.0663713637.66 schema:affiliation https://www.grid.ac/institutes/grid.36425.36
102 schema:familyName Shao
103 schema:givenName Kwang-Tsao
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0663713637.66
105 rdf:type schema:Person
106 sg:pub.10.1007/978-3-642-69024-2_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007820636
107 https://doi.org/10.1007/978-3-642-69024-2_20
108 rdf:type schema:CreativeWork
109 sg:pub.10.1007/bf02459385 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004462758
110 https://doi.org/10.1007/bf02459385
111 rdf:type schema:CreativeWork
112 sg:pub.10.1007/bfb0091818 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048594408
113 https://doi.org/10.1007/bfb0091818
114 rdf:type schema:CreativeWork
115 sg:pub.10.1016/s0092-8240(83)80039-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1054614600
116 https://doi.org/10.1016/s0092-8240(83)80039-1
117 rdf:type schema:CreativeWork
118 sg:pub.10.1038/297197a0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036488138
119 https://doi.org/10.1038/297197a0
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1145/322169.322170 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044068739
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1145/322169.322171 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025755713
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1145/359423.359434 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031866364
126 rdf:type schema:CreativeWork
127 https://doi.org/10.2307/2412810 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069921180
128 rdf:type schema:CreativeWork
129 https://doi.org/10.2307/2412969 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069921317
130 rdf:type schema:CreativeWork
131 https://doi.org/10.2307/2413252 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069921539
132 rdf:type schema:CreativeWork
133 https://doi.org/10.2307/2413254 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069921541
134 rdf:type schema:CreativeWork
135 https://www.grid.ac/institutes/grid.36425.36 schema:alternateName Stony Brook University
136 schema:name Department of Ecology and Evolution, State University of New York at Stony Brook, 11794, Stony Brook, NY, USA
137 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...