Conference item

Algorithmic complexity of motifs clusters superfamilies of networks

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Zenil, H., Kiani, N., & Tegnér, J. (2013). Algorithmic complexity of motifs clusters superfamilies of networks.

MLA Style

Zenil, H, et al. “Algorithmic Complexity of Motifs Clusters Superfamilies of Networks.” 2013.

Chicago Style

Zenil, H, N Kiani, and J Tegnér. 2013. “Algorithmic Complexity of Motifs Clusters Superfamilies of Networks.”
Print

Access Document

Publisher copy:: 10.1109/BIBM.2013.6732768

Authors

+ Zenil, H More by this author

Role:: Author

+ Kiani, N More by this author

Role:: Author

+ Tegnér, J More by this author

Role:: Author

Publisher:: IEEE
Host title:: 2013 IEEE International Conference on Bioinformatics and Biomedicine‚ Shanghai‚ China‚ December 18−21‚ 2013
Publication date:: 2013-01-01
DOI:: 10.1109/BIBM.2013.6732768
ISBN:: 9781479913091

UUID:: uuid:f62082e9-88f3-4ef0-a2c5-a764ff0cd0a1
Local pid:: cs:9312
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_f62082e988f34ef0a2c5a764ff0cd0a1

Terms of use

Copyright date:: 2013

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP