Sebastian Birk

ORCID: 0009-0005-8854-177X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Matrix Theory and Algorithms
  • Theoretical and Computational Physics
  • Scientific Research and Discoveries
  • Numerical methods for differential equations
  • Single-cell and spatial transcriptomics
  • Tensor decomposition and applications
  • Bioinformatics and Genomic Networks
  • Advanced Optimization Algorithms Research
  • Electromagnetic Scattering and Analysis
  • Gene Regulatory Network Analysis
  • Particle physics theoretical and experimental studies
  • Advanced Data Storage Technologies
  • Statistical and numerical algorithms
  • Advanced Numerical Methods in Computational Mathematics
  • Markov Chains and Monte Carlo Methods

Wellcome Sanger Institute
2024-2025

Helmholtz Zentrum München
2024-2025

University of Würzburg
2024-2025

Technical University of Munich
2024

University of Wuppertal
2011-2015

Spatial omics allow us to identify and analyze communities of cells coordinating specific functions within a tissue. While these communities, defined as cell niches, are fundamentally shaped by interactions between spatially neighboring cells, we lack computational frameworks that can leverage spatial data quantitatively characterize niches based on interaction events. To address this, introduce NicheCompass, graph deep learning method designed the principles cellular communication....

10.1101/2024.02.21.581428 preprint EN cc-by-nc-nd bioRxiv (Cold Spring Harbor Laboratory) 2024-02-23

Abstract Spatial omics enable the characterization of colocalized cell communities that coordinate specific functions within tissues. These communities, or niches, are shaped by interactions between neighboring cells, yet existing computational methods rarely leverage such for their identification and characterization. To address this gap, here we introduce NicheCompass, a graph deep-learning method models cellular communication to learn interpretable embeddings encode signaling events,...

10.1038/s41588-025-02120-6 article EN cc-by Nature Genetics 2025-03-18

We consider the task of computing solutions linear systems that only differ by a shift with identity matrix as well several different right hand sides.In past Krylov subspace methods have been developed which exploit either need for to multiple sides (e.g.deflation type and block methods) or shifts (e.g.shifted CG) some success.In this paper we present method which, based on Lanczos process, exploits both features-shifts sidesat once.Such situations arise, example, in lattice QCD simulations...

10.22323/1.139.0027 article EN cc-by-nc-sa Proceedings of XXIX International Symposium on Lattice Field Theory — PoS(Lattice 2011) 2012-07-05
Coming Soon ...