A5038280813- Ecology and Vegetation Dynamics Studies
- Mycorrhizal Fungi and Plant Interactions
- Origins and Evolution of Life
- Limits and Structures in Graph Theory
- Gastrointestinal motility and disorders
- Plant Reproductive Biology
- Legume Nitrogen Fixing Symbiosis
- Plant and animal studies
- Algorithms and Data Compression
- Gastroesophageal reflux and treatments
- Forest Ecology and Biodiversity Studies
- COVID-19 epidemiological studies
- SARS-CoV-2 and COVID-19 Research
- Machine Learning and Algorithms
- Data Mining Algorithms and Applications
- Data Management and Algorithms
- Gene Regulatory Network Analysis
- Zoonotic diseases and public health
- Helicobacter pylori-related gastroenterology studies
- Evolution and Genetic Dynamics
- Advanced Database Systems and Queries
- Lichen and fungal ecology
Alfréd Rényi Institute of Mathematics
2024
Eötvös Loránd University
2014-2023
Gibraltar is a unique densely populated multicultural British Overseas Territory for which no population data on disorders of gut-brain interaction have existed.We aimed to provide the first-ever assessment prevalence irritable bowel syndrome and functional dyspepsia in relation their diagnostic recognition healthcare burden.
This study considers the spatial structure of patchy habitats from perspective plants that forage for resources by clonal growth. Modelling is used in order to compare two basic strategies, which differ response plant a patch boundary. The 'avoiding plant' (A) never grows out good (resource-rich) into bad (resource-poor) region, because parent ramet withdraws its subsidy offspring. 'entering (E) always crosses boundary, as offspring subsidized at expense parent. In addition these extreme...
The principal component analysis is a well-known and widely used technique to determine the essential dimension of data set. Broadly speaking, it aims find low-dimensional linear manifold that retains large part information contained in original It may be case one cannot approximate entirety set using single even though subsets are amenable such approximations. For these cases we raise related but different challenge (problem) locating high dimensional approximately 1-dimensional. Naturally,...
Partite, 3-uniform hypergraphs are in which each hyperedge contains exactly one point from of the 3 disjoint vertex classes. We consider degree sequence problem partite, hypergraphs, that is, to decide if such a hypergraph with prescribed sequences exists. prove this decision is NP-complete general, and give polynomial running time algorithm for third almost-regular sequences, when classes k or − 1 some fixed , there no restriction other two also sampling problem, uniformly sample sequences....