- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1758-2946
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Compressed graph representation for scalable molecular graph generation ; volume:12 ; number:1 ; day:23 ; month:9 ; year:2020 ; pages:1-8 ; date:12.2020
Journal of cheminformatics ; 12, Heft 1 (23.9.2020), 1-8, 12.2020
- Urheber
-
Kwon, Youngchun
Lee, Dongseon
Choi, Youn-Suk
Shin, Kyoham
Kang, Seokho
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1186/s13321-020-00463-2
- URN
-
urn:nbn:de:101:1-2020111121042927505962
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kwon, Youngchun
- Lee, Dongseon
- Choi, Youn-Suk
- Shin, Kyoham
- Kang, Seokho
- SpringerLink (Online service)
Ähnliche Objekte (12)
Scalable generation of random graphs
GPU-based Graph Traversal on Compressed Graphs
Scalable graph kernels
Scalable graph partitioning for distributed graph processing
Simplitigs as an efficient and scalable representation of de Bruijn graphs
Real time scalable graph analytics
Enriched entity representation of knowledge graph for text generation
PocketGraph: graph representation of binding site volumes
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Note on standard representation of graphs and graph derivations
GRADOOP: Scalable Graph Analytics with Apache Flink
Scalable graph algorithms in Rust (and Python)
Scalable generation of random graphs
GPU-based Graph Traversal on Compressed Graphs
Scalable graph kernels
Scalable graph partitioning for distributed graph processing
Simplitigs as an efficient and scalable representation of de Bruijn graphs
Real time scalable graph analytics
Enriched entity representation of knowledge graph for text generation
PocketGraph: graph representation of binding site volumes
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Note on standard representation of graphs and graph derivations
GRADOOP: Scalable Graph Analytics with Apache Flink
Scalable graph algorithms in Rust (and Python)
Scalable generation of random graphs
GPU-based Graph Traversal on Compressed Graphs
Scalable graph kernels
Scalable graph partitioning for distributed graph processing
Simplitigs as an efficient and scalable representation of de Bruijn graphs
Real time scalable graph analytics
Enriched entity representation of knowledge graph for text generation
PocketGraph: graph representation of binding site volumes
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Note on standard representation of graphs and graph derivations
GRADOOP: Scalable Graph Analytics with Apache Flink