Algorithmic complexity of motifs clusters superfamilies of networks

Algorithmic complexity of motifs clusters superfamilies of networks

Detalhes bibliográficos
Principais autores:	Zenil, H, Kiani, N, Tegnér, J
Formato:	Conference item
Publicado em:	IEEE 2013

Registros relacionados

A Review of Graph and Network Complexity from an Algorithmic Information Perspective
por: Hector Zenil, et al.
Publicado em: (2018-07-01)

Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations
por: Hector Zenil, et al.
Publicado em: (2018-07-01)

The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
por: Hector Zenil, et al.
Publicado em: (2019-06-01)

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
por: Abrahão, FS, et al.
Publicado em: (2024)

Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results
por: Hector Zenil, et al.
Publicado em: (2023-01-01)

Low algorithmic complexity entropy-deceiving graphs
por: Zenil, H, et al.
Publicado em: (2017)

Causality, information and biological computation: an algorithmic software approach to life, disease and the immune system
por: Zenil, H, et al.
Publicado em: (2017)

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
por: Hector Zenil, et al.
Publicado em: (2018-08-01)

Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces
por: Santiago Hernández-Orozco, et al.
Publicado em: (2021-01-01)

Structural relationships in the lysozyme superfamily: significant evidence for glycoside hydrolase signature motifs.
por: Alexandre Wohlkönig, et al.
Publicado em: (2010-11-01)

Functional Roles of the Conserved Amino Acid Sequence Motif C, the Antiporter Motif, in Membrane Transporters of the Major Facilitator Superfamily
por: Manuel F. Varela, et al.
Publicado em: (2023-10-01)

The benefits of clustering in TNF receptor superfamily signaling
por: Éva S. Vanamee, et al.
Publicado em: (2023-08-01)

Evolution of the ferric reductase domain (FRD) superfamily: modularity, functional diversification, and signature motifs.
por: Xuezhi Zhang, et al.
Publicado em: (2013-01-01)

A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity
por: Zenil, H, et al.
Publicado em: (2016)

An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems
por: Hector Zenil, et al.
Publicado em: (2019-09-01)

Algorithmic Complexity of Financial Motions
por: Ma, L, et al.
Publicado em: (2014)

Evaluating conserved domains and motifs of decapod gonadotropin-releasing hormone G protein-coupled receptor superfamily
por: Sean J. Buckley, et al.
Publicado em: (2024-02-01)

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
por: Delahaye, J, et al.
Publicado em: (2012)

Brain network clustering with information flow motifs
por: Marcus Märtens, et al.
Publicado em: (2017-08-01)

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
por: Hector Zenil
Publicado em: (2020-05-01)

Targeting the Ras superfamily via their regulatory GEF complexes
por: Gray, J
Publicado em: (2021)

Quantum Motif Clustering
por: Chris Cade, et al.
Publicado em: (2023-07-01)

Motif-based spectral clustering of weighted directed networks
por: Underwood, WG, et al.
Publicado em: (2020)

Motif-based spectral clustering of weighted directed networks
por: William G. Underwood, et al.
Publicado em: (2020-09-01)

Algorithmic complexity for short binary strings applied to psychology: a primer
por: Gauvrit, N, et al.
Publicado em: (2013)

Insights into the U1 small nuclear ribonucleoprotein complex superfamily
por: Guiro, J, et al.
Publicado em: (2014)

Algorithms of Clustering and Classifying Batik Images Based on Color, Contrast and Motif
por: Veronica S. Moertini, et al.
Publicado em: (2005-11-01)

Clustering HLA class I superfamilies using structural interaction patterns.
por: Sumitro Harjanto, et al.
Publicado em: (2014-01-01)

THE IMMUNOGLOBULIN SUPERFAMILY
por: Jones, E
Publicado em: (1993)

The Eps1p protein disulfide isomerase conserves classic thioredoxin superfamily amino acid motifs but not their functional geometries.
por: Shai Biran, et al.
Publicado em: (2014-01-01)

Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method
por: Gauvrit, N, et al.
Publicado em: (2015)

Motif adjacency matrix and spectral clustering of directed weighted networks
por: Yike Wang, et al.
Publicado em: (2023-04-01)

On the Algorithmic Nature of the World
por: Zenil, J
Publicado em: (2010)

Number and location of rDNA clusters in the superfamilies Tenthredinoidea and Cynipoidea (Hymenoptera): an update
por: Vladimir E. Gokhman, et al.
Publicado em: (2024-12-01)

Kavosh: a new algorithm for finding network motifs
por: Asadi Sahar, et al.
Publicado em: (2009-10-01)

Spectral density-based clustering algorithms for complex networks
por: Taiane Coelho Ramos, et al.
Publicado em: (2023-03-01)

The extended tubulin superfamily.
por: McKean, P, et al.
Publicado em: (2001)

Conotoxin Gene Superfamilies
por: Samuel D. Robinson, et al.
Publicado em: (2014-12-01)

On the Kolmogorov−Chaitin Complexity for short sequences
por: Delahaye, J, et al.
Publicado em: (2007)

The Immunoglobulin Superfamily Member Basigin Is Required for Complex Dendrite Formation in Drosophila
por: Brikha R. Shrestha, et al.
Publicado em: (2021-11-01)