Narsis A. Kiani

Orcid: 0000-0002-0949-046X

Affiliations:
  • Karolinska Institute, Stockholm, Sweden


According to our database1, Narsis A. Kiani authored at least 43 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
CoRR, 2024

2023
Reusability report: Learning the transcriptional grammar in single-cell RNA-sequencing data using transformers.
Nat. Mac. Intell., December, 2023

LIBRA: an adaptative integrative tool for paired single-cell multi-omics data.
Quant. Biol., September, 2023

LSD-induced increase of Ising temperature and algorithmic complexity of brain dynamics.
PLoS Comput. Biol., February, 2023

A Parameter-Efficient Learning Approach to Arabic Dialect Identification with Pre-Trained General-Purpose Speech Model.
CoRR, 2023

Whispering LLaMA: A Cross-Modal Generative Error Correction Framework for Speech Recognition.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

2022
On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures.
CoRR, 2022

Model Discovery and Discrete Inverse Problems with Cellular Automata and Boolean Networks.
Proceedings of the Automata and Complexity, 2022

2020
Algorithmic Information Dynamics.
Scholarpedia, 2020

Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.
Frontiers Artif. Intell., 2020

Evolving Neural Networks through a Reverse Encoding Tree.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Causal deconvolution by algorithmic generative models.
Nat. Mach. Intell., 2019

The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy.
Entropy, 2019

Algorithmic Probability-guided Supervised Machine Learning on Non-differentiable Spaces.
CoRR, 2019

Algorithmic Information Dynamics of Emergent, Persistent, and Colliding Particles in the Game of Life.
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

2018
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks.
Parallel Process. Lett., 2018

A Review of Graph and Network Complexity from an Algorithmic Information Perspective.
Entropy, 2018

Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations.
Entropy, 2018

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
Entropy, 2018

Controllability, Multiplexing, and Transfer Learning in Networks using Evolutionary Learning.
CoRR, 2018

An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms.
CoRR, 2018

Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs.
CoRR, 2018

Ab initio Algorithmic Causal Deconvolution of Intertwined Programs and Networks by Generative Mechanism.
CoRR, 2018

Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life.
CoRR, 2018

Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss.
CoRR, 2018

2017
Dynamics and heterogeneity of brain damage in multiple sclerosis.
PLoS Comput. Biol., 2017

An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems.
CoRR, 2017

Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, modularity, diversity explosions, and mass extinction.
CoRR, 2017

HiDi: an efficient reverse engineering schema for large-scale dynamic regulatory network reconstruction using adaptive differentiation.
Bioinform., 2017

2016
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity.
CoRR, 2016

Low Algorithmic Complexity Entropy-deceiving Graphs.
CoRR, 2016

Quantifying loss of information in network-based dimensionality reduction techniques.
J. Complex Networks, 2016

2015
Evaluating Network Inference Methods in Terms of Their Ability to Preserve the Topology and Complexity of Genetic Networks.
CoRR, 2015

Topological Evaluation of Methods for Reconstruction of Genetic Regulatory Networks.
Proceedings of the 11th International Conference on Signal-Image Technology & Internet-Based Systems, 2015

Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014
Laplace transform formula on fuzzy nth-order derivative and its application in fuzzy ordinary differential equations.
Soft Comput., 2014

Dynamic Probabilistic Threshold Networks to Infer Signaling Pathways from Time-Course Perturbation Data.
BMC Bioinform., 2014

2013
Algorithmic complexity of motifs clusters superfamilies of networks.
Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

2012
Resource allocation for performance improvement.
Ann. Oper. Res., 2012

2011
Degeneracy in Fuzzy Linear Programming and its Application.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2011

Normalizing for individual cell population context in the analysis of high-content cellular screens.
BMC Bioinform., 2011

2009
Solving fuzzy differential equations by differential transformation method.
Inf. Sci., 2009

Toward the existence and uniqueness of solutions of second-order fuzzy differential equations.
Inf. Sci., 2009


  Loading...