Refine
Year of publication
Document Type
- Doctoral Thesis (36)
- Article (30)
- Final Thesis (1)
Language
- English (67) (remove)
Has Fulltext
- yes (67)
Is part of the Bibliography
- no (67)
Keywords
- - (21)
- Statistik (4)
- fractal (4)
- permutation entropy (3)
- Algebra (2)
- Bioinformatik (2)
- Bundle Gerbes (2)
- Fraktal (2)
- Funktionalanalysis (2)
- Hierarchie (2)
- Kategorientheorie (2)
- Logarithmic capacity (2)
- Mathematical Physics (2)
- NOD1/2 (2)
- Selbstähnlichkeit (2)
- YOLOv4 (2)
- animal activity (2)
- animal monitoring (2)
- autocorrelation (2)
- cellular homeostasis (2)
- computer vision (2)
- order pattern (2)
- self-similarity (2)
- signal processing (2)
- time series (2)
- tuberculosis (2)
- (generalized) linear mixed model (1)
- (verallgemeinertes) lineares gemischtes Modell (1)
- 16S rRNA gene sequencing (1)
- 33C10 (1)
- 60B15 (1)
- 60H05 (primary) (1)
- <i>A. thaliana</i> (1)
- <i>Mycobacterium avium</i> ssp. <i>paratuberculosis</i> (MAP) (1)
- <i>Mycobacterium tuberculosis</i> (1)
- AUGUSTUS (1)
- Algebra Bundles (1)
- Algebra, Funktionalanalysis (1)
- Algorithmic Cheminformatics (1)
- Algorithmus (1)
- Alignment (1)
- Alignment <Biochemie> (1)
- Alignment anchor (1)
- BAYES (1)
- Barth syndrome, Cardiolipin, tafazzin, cellular proliferation, gene expression (1)
- Bayes-Netz (1)
- Beobachtungsprozess (1)
- Bernoulli convolution (1)
- Bernoulli convolutions (1)
- Bernoulli-Faltungen (1)
- Bialgebra (1)
- Bildklassifikation (1)
- Bioinformatics (1)
- Biomathematik , Bioinformatik (1)
- Bundle gerbe (1)
- Buneman theorem (1)
- Buscher rules (1)
- Bündelgerbe (1)
- CRF (1)
- Cantor dust (1)
- Cantor set (1)
- Characteristic Attribute Organization System (1)
- Charge simulation method (1)
- Clade Annotation (1)
- Class-imbalanced Data (1)
- Classification (1)
- Cluster (1)
- Comparative Gene Finding (1)
- Comparative Genomics (1)
- Conformal map (1)
- Convergence of Markov chains (1)
- Convolutional Neural Networks (1)
- Covid-19 (1)
- DNA taxonomy (1)
- Darbellay-Vajda Partitionsregel (1)
- Darstellung (1)
- Data Science (1)
- Dichteschätzung (1)
- Differentialgeometrie (1)
- Differentialgleichung (1)
- Dimensionsreduktion (1)
- Dual Decomposition (1)
- Dualität (1)
- Dynamical System (1)
- Dynamische Systeme (1)
- ELISA (1)
- Elastizitätstheorie (1)
- Enzym (1)
- Eulerian numbers (1)
- Evolution (1)
- Evolution der Genregulation (1)
- Evolution of Gene Regulation (1)
- Expressionsdaten (1)
- Fast multipole method (1)
- Fettleber (1)
- Fock-Raum (1)
- GMRES method (1)
- GNS-Konstruktion (1)
- Gammaverteilung (1)
- Gene Structure Prediction (1)
- Gene prediction (1)
- Genetic Evolution (1)
- Genetische Netzwerke (1)
- Genome Annotation (1)
- Genome alignment (1)
- Genregulation (1)
- Geometric hashing (1)
- Geometrie (1)
- Geometry (1)
- Germany (1)
- Graph (1)
- Graph Theory (1)
- Graphentheorie (1)
- Graphenzeichnen (1)
- Green’s function (1)
- Grenzwertsatz (1)
- Hausdorff-Dimension (1)
- High-Dimensional Data (1)
- Highest density regions (1)
- Histogramm (1)
- Histogramm-Konstruktion (1)
- Histogramme (1)
- Hoch-dimensionale Daten (1)
- Hochdurchsatz (1)
- Hopf bundle (1)
- Hopf-Algebra (1)
- Hopfbündel (1)
- Hutchinson Operator (1)
- Hutchinson-Operator (1)
- Hybride stochastische Modelle (1)
- IL-10 (1)
- Image Classification (1)
- Imbalancierte Daten (1)
- In-Host Modeling (1)
- Infinite Dimensional Geometry (1)
- Informationsabhängigkeit (1)
- Informationsvisualisierung (1)
- Innerwurfvarianz (1)
- Integer Linear Program (1)
- Interaktionsfläche (1)
- Interpretability (1)
- Interpretable Machine Learning (1)
- Iterated Function System (1)
- Iteriertes Funktionensystem (1)
- Kotensorfunktor (1)
- Labelingproblem (1)
- Lagrangian Relaxation (1)
- Latent Structure (1)
- Lemniscatic domain (1)
- Level-Set-Methode (1)
- Likelihood-Quotienten-Test (1)
- Linear Elasticity (1)
- Lévy processes (1)
- Lévy-Prozess (1)
- Lévy-prozess (1)
- MCMC (1)
- Markierungswiederherstellung (1)
- Markov-Kette (1)
- Maschinelles Lernen (1)
- Mathematical Phylogenetic (1)
- Mathematical Phylogenetics (1)
- Mathematik (1)
- Mathematische Modellierung (1)
- Mathematische Phylogenetik (1)
- Maßanalyse (1)
- Metabolismus (1)
- Miniprot (1)
- Minkowski-Metrik (1)
- Model selection (1)
- Modeling Infection (1)
- Modeling Tryptophan-Metabolism (1)
- Modeling in Pigs (1)
- Modeling of Infectious Diseases (1)
- Modellierung (1)
- Monoidale Kategorie (1)
- Multiply connected domain (1)
- NGS (1)
- NLRP1 (1)
- NLRP3 (1)
- NOD-like receptors (1)
- NOD‐like receptors (1)
- NP-completeness (1)
- Network (1)
- Netzwerk (1)
- Nichtlineares dynamisches System (1)
- One Health (1)
- Optimal Control (1)
- Optimale Kontrolle (1)
- Outlier Detection (1)
- Outlier-Erkennung (1)
- PD-L1 (1)
- PDE (1)
- Perron-Frobenius theorem (1)
- Phylogenetic tree (1)
- Phylogenetics (1)
- Pisot-Zahl (1)
- Polynomial pre-image (1)
- Position Specific Scoring Matrix (1)
- Protein (1)
- Protein coding gene (1)
- Proteinwechselwirkungsstelle (1)
- Quanten-Lévy-Prozess (1)
- Quantengruppe (1)
- Quantenwahrscheinlichkeitstheorie (1)
- Quasi-Pseudo-Metrik (1)
- Random matrices (1)
- Randomisierung (1)
- Rechenmethoden (1)
- SNP-specific alpha-level, colocalization (1)
- SPecies IDentity and Evolution in R (1)
- Schale (1)
- Schwein (1)
- Segmentierung (1)
- Self-assembling protein design (1)
- Shells (1)
- Simulation (1)
- Slice (1)
- Spaced seeds (1)
- Spannender Baum (1)
- Spektrum (1)
- Spike and Slab (1)
- Statistics (1)
- Stetiger Markov-Prozess (1)
- Stoffwechselweg (1)
- String Geometry (1)
- Stückweise deterministischer Markov Prozess (1)
- T-Duality (1)
- T-Dualität (1)
- Taxonomie (1)
- Test von zufälligen Effekten (1)
- Transcription Factor Binding Site (1)
- Transfer Operator (1)
- Transfer-Operator (1)
- Transkriptionsfaktorbindestellen (1)
- Treemap (1)
- Tryptophan (1)
- Tryptophan-Metabolism (1)
- Twisted K-Theory (1)
- Unabhängigkeitanalyse (1)
- Ungewissheit (1)
- Urinary albumin to creatinine ratio (UACR) (1)
- Variationsrechnung (1)
- Visualisierung (1)
- Visualization (1)
- Vorhersage (1)
- X-splits (1)
- Zufallsmatrizen (1)
- Zylinderschale (1)
- aging (1)
- alternative splicing (1)
- animal behavior (1)
- animal welfare (1)
- aperiodic tile (1)
- bacterial-fungal interaction (1)
- beta-representation (1)
- bioinformatics (1)
- biologischer Quellen (1)
- body posture (1)
- cattle trade (1)
- cell biology (1)
- cell fractionation (1)
- classification models (1)
- co-transcriptional regulation (1)
- community detection (1)
- concentration coefficient (1)
- conditional association analysis (1)
- conditional random field (1)
- dairy cows (1)
- diagnostic (genetic) characters (1)
- drug (1)
- duale Halbgruppe (1)
- emerging diseases (1)
- environmental samples (1)
- epidemic model (1)
- estimated glomerular filtration rate (eGFR) (1)
- exhaled breath (1)
- expression quantitative trait loci (eQTL) (1)
- fecal culture (1)
- fecal headspace (1)
- fluorescent pseudomonads (1)
- free probability (1)
- fungal growth inhibition (1)
- gamma distribution (1)
- gene expression (1)
- genome-wide association studies (GWAS) (1)
- granuloma (1)
- high temperature (1)
- histogram construction (1)
- histograms (1)
- immunology (1)
- infectious diseases (1)
- inflammation (1)
- influenza A virus infection (1)
- innate immunity (1)
- integrative taxonomy (1)
- invariant measure (1)
- invariantes Maß (1)
- konsistente Schätzung (1)
- kw: Graph Theory (1)
- latent class model (1)
- liver disease (1)
- mRNA (1)
- machine learning (1)
- mathematical modeling (1)
- mathematical statistics (1)
- mathematische Statistik (1)
- maximum parsimony (1)
- metaproteome (1)
- microRNA (1)
- microarray (1)
- microbiome (1)
- microfluidic device (1)
- migratory connectivity (1)
- milk pools (1)
- mixed binomial point process (1)
- mixture proposals (1)
- modularity (1)
- multinomial distribution (1)
- multiple sequence alignment (1)
- myeloid-derived suppressor cells (1)
- neighbor map (1)
- network analysis (1)
- neutrophils (1)
- nichtparametrische Dichteschätzung (1)
- non-commutative independences (1)
- nonparametric density estimation (1)
- observation process (1)
- oocyte (1)
- ordinal time series (1)
- ovine anaplasmosis (1)
- parametric bootstrap (1)
- parametrisches Bootstrap (1)
- paratuberculosis (1)
- pathogens (1)
- pathology (1)
- plant pathogen (1)
- pn: Nikolai Nøjgaard (1)
- pre-mRNA (1)
- probabilistic interface labeling problem (1)
- profile hidden Markov model (1)
- protein (1)
- proteome (1)
- quadratic number field (1)
- quantum groups (1)
- quantum probability (1)
- random forest (1)
- randomization (1)
- real-time PCR (1)
- red foxes (1)
- regulatory networks (1)
- relative entropy (1)
- reprogramming (1)
- restricted M-splines (1)
- räumliches Überleben (1)
- self-similar (1)
- sheep (1)
- sleep stages (1)
- small molecule (1)
- snoRNAs (1)
- sparsame Darstellung von Daten (1)
- sparse representation of data (1)
- spatial survival (1)
- spectrum (1)
- sphingolipid metabolism (1)
- splicing regulation (1)
- stable air (1)
- statistics (1)
- stichprobenabhängige Partitionsregel (1)
- stochastic block model (1)
- subsp. (1)
- systems biology (1)
- test of random effects (1)
- tick-borne fever (1)
- tiling, self-similarity, fractal, aperiodic, iterated function system (1)
- tissue specificity (1)
- trans dimensional sampling (1)
- universelles Produkt (1)
- virology (1)
- volatile organic compound (VOC) (1)
- within-litter variation (1)
Institute
- Institut für Mathematik und Informatik (67) (remove)
Publisher
- MDPI (14)
- Frontiers Media S.A. (6)
- Springer Nature (4)
- BioMed Central (BMC) (2)
- Oxford University Press (1)
- Wiley (1)
We apply the charge simulation method (CSM) in order to compute the logarithmic capacity of compact sets consisting of (infinitely) many “small” components. This application allows to use just a single charge point for each component. The resulting method therefore is significantly more efficient than methods based on discretizations of the boundaries (for example, our own method presented in Liesen et al. (Comput. Methods Funct. Theory 17, 689–713, 2017)), while maintaining a very high level of accuracy. We study properties of the linear algebraic systems that arise in the CSM, and show how these systems can be solved efficiently using preconditioned iterative methods, where the matrix-vector products are computed using the fast multipole method. We illustrate the use of the method on generalized Cantor sets and the Cantor dust.
Background
The alignment of large numbers of protein sequences is a challenging task and its importance grows rapidly along with the size of biological datasets. State-of-the-art algorithms have a tendency to produce less accurate alignments with an increasing number of sequences. This is a fundamental problem since many downstream tasks rely on accurate alignments.
Results
We present learnMSA, a novel statistical learning approach of profile hidden Markov models (pHMMs) based on batch gradient descent. Fundamentally different from popular aligners, we fit a custom recurrent neural network architecture for (p)HMMs to potentially millions of sequences with respect to a maximum a posteriori objective and decode an alignment. We rely on automatic differentiation of the log-likelihood, and thus, our approach is different from existing HMM training algorithms like Baum–Welch. Our method does not involve progressive, regressive, or divide-and-conquer heuristics. We use uniform batch sampling to adapt to large datasets in linear time without the requirement of a tree. When tested on ultra-large protein families with up to 3.5 million sequences, learnMSA is both more accurate and faster than state-of-the-art tools. On the established benchmarks HomFam and BaliFam with smaller sequence sets, it matches state-of-the-art performance. All experiments were done on a standard workstation with a GPU.
Conclusions
Our results show that learnMSA does not share the counterintuitive drawback of many popular heuristic aligners, which can substantially lose accuracy when many additional homologs are input. LearnMSA is a future-proof framework for large alignments with many opportunities for further improvements.
The classical Buscher rules d escribe T-duality for metrics and B-fields in a topologically trivial setting. On the other hand, topological T-duality addresses aspects of non-trivial topology while neglecting metrics and B-fields. In this article, we develop a new unifying framework for both aspects.
Convolutional Neural Network-based image classification models are the current state-of-the-art for solving image classification problems. However, obtaining and using such a model to solve a specific image classification problem presents several challenges in practice. To train the model, we need to find good hyperparameter values for training, such as initial model weights or learning rate. However, finding these values is usually a non-trivial process. Another problem is that the training data used for model training is often class-imbalanced in practice. This usually has a negative impact on model training. However, not only is it challenging to obtain a Convolutional Neural Network-based model, but also to use the model after model training. After training, the model might be applied to images that were drawn from a data distribution that is different from the data distribution the training data was drawn from. These images are typically referred to as out-of-distribution samples. Unfortunately, Convolutional Neural Network-based image classification models typically fail to predict the correct class for out-of-distribution samples without warning, which is problematic when such a model is used for safety-critical applications. In my work, I examined whether information from the layers of a Convolutional Neural Network-based image classification model (pixels and activations) can be used to address all of these issues. As a result, I suggest a method for initializing the model weights based on image patches, a method for balancing a class-imbalanced dataset based on layer activations, and a method for detecting out-of-distribution samples, which is also based on layer activations. To test the proposed methods, I conducted extensive experiments using different datasets. My experiments showed that layer information (pixels and activations) can indeed be used to address all of the aforementioned challenges when training and using Convolutional Neural Network-based image classification models.
Phylogenetic (i.e., leaf-labeled) trees play a fundamental role in evolutionary research. A typical problem is to reconstruct such trees from data like DNA alignments (whose columns are often referred to as characters), and a simple optimization criterion for such reconstructions is maximum parsimony. It is generally assumed that this criterion works well for data in which state changes are rare. In the present manuscript, we prove that each binary phylogenetic tree T with n ≥ 20k leaves is uniquely defined by the set Ak (T), which consists of all characters with parsimony score k on T. This can be considered as a promising first step toward showing that maximum parsimony as a tree reconstruction criterion is justified when the number of changes in the data is relatively small.
We consider Walsh’s conformal map from the exterior of a compact set E ⊆ C onto a lemniscatic domain. If E is simply connected, the lemniscatic domain is the exterior of a circle, while if E has several components, the lemniscatic domain is the exterior of a generalized lemniscate and is determined by the logarithmic capacity of E and by the exponents and centers of the generalized lemniscate. For general E, we characterize the exponents in terms of the Green’s function of Ec. Under additional symmetry conditions on E, we also locate the centers of the lemniscatic domain. For polynomial pre-images E = P−1(Ω) of a simply-connected infinite compact set Ω, we explicitly determine the exponents in the lemniscatic domain and derive a set of equations to determine the centers of the lemniscatic domain. Finally, we present several examples where we explicitly obtain the exponents and centers of the lemniscatic domain, as well as the conformal map.
Background
The Earth Biogenome Project has rapidly increased the number of available eukaryotic genomes, but most released genomes continue to lack annotation of protein-coding genes. In addition, no transcriptome data is available for some genomes.
Results
Various gene annotation tools have been developed but each has its limitations. Here, we introduce GALBA, a fully automated pipeline that utilizes miniprot, a rapid protein-to-genome aligner, in combination with AUGUSTUS to predict genes with high accuracy. Accuracy results indicate that GALBA is particularly strong in the annotation of large vertebrate genomes. We also present use cases in insects, vertebrates, and a land plant. GALBA is fully open source and available as a docker image for easy execution with Singularity in high-performance computing environments.
Conclusions
Our pipeline addresses the critical need for accurate gene annotation in newly sequenced genomes, and we believe that GALBA will greatly facilitate genome annotation for diverse organisms.
Background
An important initial phase of arguably most homology search and alignment methods such as required for genome alignments is seed finding. The seed finding step is crucial to curb the runtime as potential alignments are restricted to and anchored at the sequence position pairs that constitute the seed. To identify seeds, it is good practice to use sets of spaced seed patterns, a method that locally compares two sequences and requires exact matches at certain positions only.
Results
We introduce a new method for filtering alignment seeds that we call geometric hashing. Geometric hashing achieves a high specificity by combining non-local information from different seeds using a simple hash function that only requires a constant and small amount of additional time per spaced seed. Geometric hashing was tested on the task of finding homologous positions in the coding regions of human and mouse genome sequences. Thereby, the number of false positives was decreased about million-fold over sets of spaced seeds while maintaining a very high sensitivity.
Conclusions
An additional geometric hashing filtering phase could improve the run-time, accuracy or both of programs for various homology-search-and-align tasks.
Statistical Methods and Applications for Biomarker Discovery Using Large Scale Omics Data Set
(2023)
This thesis focuses on identifying genetic factors associated with human kidney disease progression, with three articles presented. Article I describes the identification of loci associated with UACR through trans-ethnic, European-ancestry-specific, and diabetes-specific meta-analyses. An approximate conditional analysis was performed to identify additional independent UACR-associated variants within identified loci. The genome-wide significance level of 𝛼=5×10−8 is used for both primary GWAS association and conditional analyses. However, unlike primary association tests, conditional tests are limited to specific genomic regions surrounding primary GWAS index signals rather than being applied on a genome-wide scale.
In article II, we hypothesized that the application of 𝛼=5×10−8 is overly strict and results in a loss of power. To address this issue, we developed a quasi-adaptive method within a weighted hypothesis testing framework. This method exploits the type I error (𝛼=0.05) by providing less conservative SNP specific 𝛼-thresholds to select secondary signals in conditional analysis. Through simulation studies and power analyses, we demonstrate that the quasi-adaptive method outperforms the established criterion 𝛼=5×10−8 as well as the equal weighting scheme (the Sidak-correction). Furthermore, our method performs well when applied to real datasets and can potentially reveal previously undetected secondary signals in existing data.
In article III, we extended our quasi-adaptive method to identify plausible multiple independent signals at each locus (a secondary signal, a tertiary signal, a signal of 4th, and beyond) and applied it to the publically available GWAS meta-analysis to detect additional multiple independent eGFR-associated signals. The improved quasi-adaptive method successfully identified additional novel replicated independent SNPs that would have gone undetected by applying too conservative genome-wide significance level of 𝛼=5× 10−8. Colocalization analysis based on the novel independent signals identified potentially functional genes across the kidney and other tissues.
Overall, these articles contribute to the understanding of genetic factors associated with human kidney disease progression and provide novel methods for identifying secondary and multiple independent signals in conditional GWAS analyses.
Gram-negative bacteria secrete lipopolysaccharides (LPS), leading to a host immune
response of proinflammatory cytokine secretion. Those proinflammatory cytokines are
TNF-α and IFN-γ, which induce the production of indoleamine 2,3-dioxygenase (IDO). IDO production is increased during severe sepsis, and septic shock. High IDO
levels are associated with increased mortality. This enzyme catalyzes the degradation of tryptophan (TRP) to kynurenine (KYN) along the kynurenine pathway (KP).
KYN is further degraded to kynurenic acid (KYNA). Increased IDO levels accompany
with increased levels of KYNA, which is associated with immunoparalysis.
Due to its central role, the KP is a potential target of therapeutic intervention.
The degradation of TRP to KYN by IDO was intervened by 1-Methyltryptophan (1-
MT), which is assumed to inhibit IDO. By administering 1-MT, the survival of
1-MT-treated mice suffering from sepsis increased compared to mice not treated with
1-MT. The levels of downstream metabolites such as KYN and KYNA were
expected to be decreased. Surprisingly, in healthy mice and pigs, an increase in KYNA
after 1-MT administration was reported. Those unexpected metabolite alterations after 1-MT administration, and the mode of action, were not the focus of recent
research. Hence, there is no explanation for KYNA increase, while KYN did not change.
This thesis aims to postulate a possible degradation pathway of 1-MT along the KP
with the help of ordinary differential equation (ODE) systems.
Moreover, the developed ODE models were used to determine the ability of 1-MT to
inhibit IDO in vivo. Therefore, a multiplicity of ODE models were developed, including
a model of the KP, an extension by lipopolysaccharide (LPS) administration, and 1-MT
administration.
Moreover, seven ODE models were developed, all considering possible degradation pathways of 1-MT. The most likely degradation pathway was combined with the ODE model
of LPS administration, including the inhibitory effects of 1-MT.
Those models consist of several dependent equations describing the dynamics of the KP.
For each component of the KP, one equation describes the alterations over time. Equations for TRP, KYN, KYNA, and quinolinic acid (QUIN) were developed.
Moreover, the alterations of serotonin (SER) were also included. All together belong
to the TRP metabolism. They include the degradation of TRP to SER and to KYN,
which is further degraded to KYNA and QUIN. Every degradation is catalyzed by an enzyme. Therefore, Michaelis-Menten (MM) equations were used employing the substrate
constant Km and the maximal degradation velocity Vmax. To reduce the complexity of
parameter calculation, Km values of the different enzymes were fixed to literature values.
The remaining parameters of the equations were determined so that the trajectories of
the calculated metabolite levels correspond to data. The parameters of different models were determined. To propose a degradation pathway of 1-MT leading to increased
KYNA levels, seven models were developed and compared. The most likely model was
extended to test whether the inhibitory effects of 1-MT on IDO can be determined.
Three different approaches determined the ODE model parameters of the different hypothesis of 1-MT degradation. In the first approach, ODE model parameters were fixed
to values fitted to an independent data set. In the second approach, parameters were
fitted to a subset of the data set, which was used for simulations of the different hypotheses. The third approach calculated ODE model parameters 100 times without
fixed parameters. The parameter set ending up in trajectories of the TRP metabolites,
which have the smallest distance to the data, was assumed to be the most likely. The
ODE model parameters were fitted to data measured in pigs. Two different
experimental models delivered data used in this thesis. The first experimental model
activates IDO by LPS administration in pigs. The second one combines the IDO
activation by LPS with the administration of 1-MT in pigs.
The most likely hypothesis, according to approach 1 was the degradation of 1-MT to
KYNA and TRP. For the second data set the most likely one was the direct degradation of 1-MT to KYNA. With approach 2 the most likely degradation pathways were
the combination of all degradation pathways and the degradation of 1-MT to TRP and
TRP to KYNA. With approach 3 the most likely way of KYNA increase was given by
the direct degradation of 1-MT to KYNA. In summary, the three approaches revealed
hypothesis 2, the direct degradation of 1-MT to KYNA most frequently. A cell-free
assay validated this result. This experiment combined 1-MT or TRP with or without
the enzyme kynurenine aminotransferase (KAT). KAT was already shown to degrade
TRP directly to KYNA. The levels of TRP, KYN and KYNA were measured. The
highest KYNA levels were yielded with an assay adding KAT to 1-MT, corresponding
to hypothesis 2. The models describing the inhibitory effects of 1-MT revealed that
the model without inhibitory effects of 1-MT on IDO was more likely for all three approaches.
The correctness of hypothesis 2 has to be confirmed by further in vitro experiments. It
also has to be investigated which reactions promote the degradation of 1-MT to KYNA.
The missing inhibitory properties of 1-MT on IDO, determined by the in silico ODE
models, align with previous research. It was shown that the saturation of 1-MT was too
low, e.g. in pigs, to inhibit IDO efficiently.
In this study, the first possible degradation pathway of 1-MT along the KP is proposed.
The reliability of the results depends on the quality of the experimental data, and the
season, when data were measured. Moreover, the results vary between the different
approaches of parameter fitting. Different approaches of parameter fitting have to be
included in the analysis to get more evidence for the correctness of the results.