CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 9168-9354 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T61","span":{"begin":0,"end":186},"obj":"Sentence"}],"text":"Quickest-Path-UBG and Local-Reduction-UBG to address the DTM problem for large networks, which are close to UBG in performance but orders of magnitude faster than UBG in time complexity."}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T61","span":{"begin":0,"end":186},"obj":"Sentence"},{"id":"TextSentencer_T61","span":{"begin":0,"end":186},"obj":"Sentence"},{"id":"T17246","span":{"begin":0,"end":186},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"Quickest-Path-UBG and Local-Reduction-UBG to address the DTM problem for large networks, which are close to UBG in performance but orders of magnitude faster than UBG in time complexity."}