scispace - formally typeset
Z

Zoran Nikoloski

Researcher at University of Potsdam

Publications -  252
Citations -  8857

Zoran Nikoloski is an academic researcher from University of Potsdam. The author has contributed to research in topics: Metabolic network & Biology. The author has an hindex of 44, co-authored 218 publications receiving 7199 citations. Previous affiliations of Zoran Nikoloski include Charles University in Prague & Max Planck Society.

Papers
More filters
Journal ArticleDOI

On Modularity Clustering

TL;DR: The conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts is proved and an Integer Linear Programming formulation is given.
Journal ArticleDOI

PlaNet: Combined Sequence and Expression Comparisons across Plant Networks Derived from Seven Species

TL;DR: The PlaNet platform enables comparative analysis of genome-wide coexpression networks across seven plant species, thus enabling prediction of gene function and elucidation of the identity of functional homologs, and can swiftly infer similar coexpressed network vicinities within and across species.
Journal ArticleDOI

Metabolic Fluxes in an Illuminated Arabidopsis Rosette

TL;DR: A method to resolve intracellular fluxes in intact Arabidopsis thaliana rosettes based on time-dependent labeling patterns in the metabolome is described and the robustness of the estimates is assessed with respect to different features of the underlying metabolic model and the time-resolved data set.
Journal ArticleDOI

Metabolic control and regulation of the tricarboxylic acid cycle in photosynthetic and heterotrophic plant tissues.

TL;DR: Results indicate that the control of the tricarboxylic acid pathway is distributed among malate dehydrogenase, aconitase, fumarase, succinate dehydrogenases and 2-oxoglutarate dehydrationrogenase.
Book ChapterDOI

On finding graph clusterings with maximum modularity

TL;DR: It is proved the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and an Integer Linear Programming formulation is given.