Publication

Microautophagy: definition, classification, and the complexity of the underlying mechanisms

2025

Abstract

Recently, rapid progress in the field of microautophagy (MI-autophagy) revealed the existence of multiple subtypes that differ in both intracellular membrane dynamics and molecular mechanisms. As a result, a single umbrella term "microautophagy" has become too vague, even creating some confusion among researchers both within and outside the field. We herein describe different subtypes of MI-autophagic processes and propose a systematic approach for naming them more accurately.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2025

Abstract

Official source

Related concepts (32)

Complexity class

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Autophagy

Autophagy (or autophagocytosis; from the Ancient Greek αὐτόφαγος, , meaning "self-devouring" and κύτος, , meaning "hollow") is the natural, conserved degradation of the cell that removes unnecessary or dysfunctional components through a lysosome-dependent regulated mechanism. It allows the orderly degradation and recycling of cellular components. Although initially characterized as a primordial degradation pathway induced to protect against starvation, it has become increasingly clear that autophagy also plays a major role in the homeostasis of non-starved cells.

Related publications (15)

Microautophagy: definition, classification, and the complexity of the underlying mechanisms

Chat with Graph Search

Projected distances for multi-parameter persistence modules

On the Evaluation of Recognition Performance in Protected Biometric Systems

Implementation of an Electrostatic Device for Investigation of Electric Fields on Cells