Algorithmic complexity of motifs clusters superfamilies of networks

Бібліографічні деталі
Автори: Zenil, H, Kiani, N, Tegnér, J
Формат: Conference item
Опубліковано: IEEE 2013
_version_ 1826305343046549504
author Zenil, H
Kiani, N
Tegnér, J
author_facet Zenil, H
Kiani, N
Tegnér, J
author_sort Zenil, H
collection OXFORD
description
first_indexed 2024-03-07T06:31:27Z
format Conference item
id oxford-uuid:f62082e9-88f3-4ef0-a2c5-a764ff0cd0a1
institution University of Oxford
last_indexed 2024-03-07T06:31:27Z
publishDate 2013
publisher IEEE
record_format dspace
spelling oxford-uuid:f62082e9-88f3-4ef0-a2c5-a764ff0cd0a12022-03-27T12:32:40ZAlgorithmic complexity of motifs clusters superfamilies of networksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:f62082e9-88f3-4ef0-a2c5-a764ff0cd0a1Department of Computer ScienceIEEE2013Zenil, HKiani, NTegnér, J
spellingShingle Zenil, H
Kiani, N
Tegnér, J
Algorithmic complexity of motifs clusters superfamilies of networks
title Algorithmic complexity of motifs clusters superfamilies of networks
title_full Algorithmic complexity of motifs clusters superfamilies of networks
title_fullStr Algorithmic complexity of motifs clusters superfamilies of networks
title_full_unstemmed Algorithmic complexity of motifs clusters superfamilies of networks
title_short Algorithmic complexity of motifs clusters superfamilies of networks
title_sort algorithmic complexity of motifs clusters superfamilies of networks
work_keys_str_mv AT zenilh algorithmiccomplexityofmotifsclusterssuperfamiliesofnetworks
AT kianin algorithmiccomplexityofmotifsclusterssuperfamiliesofnetworks
AT tegnerj algorithmiccomplexityofmotifsclusterssuperfamiliesofnetworks