---
_id: '13263'
abstract:
- lang: eng
  text: "Motivation: Boolean networks are simple but efficient mathematical formalism
    for modelling complex biological systems. However, having only two levels of activation
    is sometimes not enough to fully capture the dynamics of real-world biological
    systems. Hence, the need for multi-valued networks (MVNs), a generalization of
    Boolean networks. Despite the importance of MVNs for modelling biological systems,
    only limited progress has been made on developing theories, analysis methods,
    and tools that can support them. In particular, the recent use of trap spaces
    in Boolean networks made a great impact on the field of systems biology, but there
    has been no similar concept defined and studied for MVNs to date.\r\n\r\nResults:
    In this work, we generalize the concept of trap spaces in Boolean networks to
    that in MVNs. We then develop the theory and the analysis methods for trap spaces
    in MVNs. In particular, we implement all proposed methods in a Python package
    called trapmvn. Not only showing the applicability of our approach via a realistic
    case study, we also evaluate the time efficiency of the method on a large collection
    of real-world models. The experimental results confirm the time efficiency, which
    we believe enables more accurate analysis on larger and more complex multi-valued
    models."
acknowledgement: This work was supported by L’Institut Carnot STAR, Marseille, France,
  and by the European Union’s Horizon 2020 research and innovation programme under
  the Marie Skłodowska-Curie Grant Agreement No. [101034413].
article_processing_charge: Yes
article_type: original
author:
- first_name: Van Giang
  full_name: Trinh, Van Giang
  last_name: Trinh
- first_name: Belaid
  full_name: Benhamou, Belaid
  last_name: Benhamou
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Samuel
  full_name: Pastva, Samuel
  id: 07c5ea74-f61c-11ec-a664-aa7c5d957b2b
  last_name: Pastva
  orcid: 0000-0003-1993-0331
citation:
  ama: 'Trinh VG, Benhamou B, Henzinger TA, Pastva S. Trap spaces of multi-valued
    networks: Definition, computation, and applications. <i>Bioinformatics</i>. 2023;39(Supplement_1):i513-i522.
    doi:<a href="https://doi.org/10.1093/bioinformatics/btad262">10.1093/bioinformatics/btad262</a>'
  apa: 'Trinh, V. G., Benhamou, B., Henzinger, T. A., &#38; Pastva, S. (2023). Trap
    spaces of multi-valued networks: Definition, computation, and applications. <i>Bioinformatics</i>.
    Oxford Academic. <a href="https://doi.org/10.1093/bioinformatics/btad262">https://doi.org/10.1093/bioinformatics/btad262</a>'
  chicago: 'Trinh, Van Giang, Belaid Benhamou, Thomas A Henzinger, and Samuel Pastva.
    “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.”
    <i>Bioinformatics</i>. Oxford Academic, 2023. <a href="https://doi.org/10.1093/bioinformatics/btad262">https://doi.org/10.1093/bioinformatics/btad262</a>.'
  ieee: 'V. G. Trinh, B. Benhamou, T. A. Henzinger, and S. Pastva, “Trap spaces of
    multi-valued networks: Definition, computation, and applications,” <i>Bioinformatics</i>,
    vol. 39, no. Supplement_1. Oxford Academic, pp. i513–i522, 2023.'
  ista: 'Trinh VG, Benhamou B, Henzinger TA, Pastva S. 2023. Trap spaces of multi-valued
    networks: Definition, computation, and applications. Bioinformatics. 39(Supplement_1),
    i513–i522.'
  mla: 'Trinh, Van Giang, et al. “Trap Spaces of Multi-Valued Networks: Definition,
    Computation, and Applications.” <i>Bioinformatics</i>, vol. 39, no. Supplement_1,
    Oxford Academic, 2023, pp. i513–22, doi:<a href="https://doi.org/10.1093/bioinformatics/btad262">10.1093/bioinformatics/btad262</a>.'
  short: V.G. Trinh, B. Benhamou, T.A. Henzinger, S. Pastva, Bioinformatics 39 (2023)
    i513–i522.
date_created: 2023-07-23T22:01:12Z
date_published: 2023-06-30T00:00:00Z
date_updated: 2023-12-13T11:41:52Z
day: '30'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1093/bioinformatics/btad262
ec_funded: 1
external_id:
  isi:
  - '001027457000060'
  pmid:
  - '37387165'
file:
- access_level: open_access
  checksum: ba3abe1171df1958413b7c7f957f5486
  content_type: application/pdf
  creator: dernst
  date_created: 2023-07-31T11:09:05Z
  date_updated: 2023-07-31T11:09:05Z
  file_id: '13335'
  file_name: 2023_Bioinformatics_Trinh.pdf
  file_size: 641736
  relation: main_file
  success: 1
file_date_updated: 2023-07-31T11:09:05Z
has_accepted_license: '1'
intvolume: '        39'
isi: 1
issue: Supplement_1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: i513-i522
pmid: 1
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: Bioinformatics
publication_identifier:
  eissn:
  - 1367-4811
  issn:
  - 1367-4803
publication_status: published
publisher: Oxford Academic
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/giang-trinh/trap-mvn
scopus_import: '1'
status: public
title: 'Trap spaces of multi-valued networks: Definition, computation, and applications'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2023'
...
---
_id: '12876'
abstract:
- lang: eng
  text: "Motivation: The problem of model inference is of fundamental importance to
    systems biology. Logical models (e.g. Boolean networks; BNs) represent a computationally
    attractive approach capable of handling large biological networks. The models
    are typically inferred from experimental data. However, even with a substantial
    amount of experimental data supported by some prior knowledge, existing inference
    methods often focus on a small sample of admissible candidate models only.\r\n\r\nResults:
    We propose Boolean network sketches as a new formal instrument for the inference
    of Boolean networks. A sketch integrates (typically partial) knowledge about the
    network’s topology and the update logic (obtained through, e.g. a biological knowledge
    base or a literature search), as well as further assumptions about the properties
    of the network’s transitions (e.g. the form of its attractor landscape), and additional
    restrictions on the model dynamics given by the measured experimental data. Our
    new BNs inference algorithm starts with an ‘initial’ sketch, which is extended
    by adding restrictions representing experimental data to a ‘data-informed’ sketch
    and subsequently computes all BNs consistent with the data-informed sketch. Our
    algorithm is based on a symbolic representation and coloured model-checking. Our
    approach is unique in its ability to cover a broad spectrum of knowledge and efficiently
    produce a compact representation of all inferred BNs. We evaluate the method on
    a non-trivial collection of real-world and simulated data."
acknowledgement: This work was partially supported by GACR [grant No. GA22-10845S];
  and Grant Agency of Masaryk University [grant No. MUNI/G/1771/2020]. This work was
  partially supported by European Union’s Horizon 2020 research and innovation programme
  under the Marie Skłodowska-Curie [Grant Agreement No. 101034413 to S.P.].
article_number: btad158
article_processing_charge: No
article_type: original
author:
- first_name: Nikola
  full_name: Beneš, Nikola
  last_name: Beneš
- first_name: Luboš
  full_name: Brim, Luboš
  last_name: Brim
- first_name: Ondřej
  full_name: Huvar, Ondřej
  last_name: Huvar
- first_name: Samuel
  full_name: Pastva, Samuel
  id: 07c5ea74-f61c-11ec-a664-aa7c5d957b2b
  last_name: Pastva
- first_name: David
  full_name: Šafránek, David
  last_name: Šafránek
citation:
  ama: 'Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. Boolean network sketches:
    A unifying framework for logical model inference. <i>Bioinformatics</i>. 2023;39(4).
    doi:<a href="https://doi.org/10.1093/bioinformatics/btad158">10.1093/bioinformatics/btad158</a>'
  apa: 'Beneš, N., Brim, L., Huvar, O., Pastva, S., &#38; Šafránek, D. (2023). Boolean
    network sketches: A unifying framework for logical model inference. <i>Bioinformatics</i>.
    Oxford Academic. <a href="https://doi.org/10.1093/bioinformatics/btad158">https://doi.org/10.1093/bioinformatics/btad158</a>'
  chicago: 'Beneš, Nikola, Luboš Brim, Ondřej Huvar, Samuel Pastva, and David Šafránek.
    “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.”
    <i>Bioinformatics</i>. Oxford Academic, 2023. <a href="https://doi.org/10.1093/bioinformatics/btad158">https://doi.org/10.1093/bioinformatics/btad158</a>.'
  ieee: 'N. Beneš, L. Brim, O. Huvar, S. Pastva, and D. Šafránek, “Boolean network
    sketches: A unifying framework for logical model inference,” <i>Bioinformatics</i>,
    vol. 39, no. 4. Oxford Academic, 2023.'
  ista: 'Beneš N, Brim L, Huvar O, Pastva S, Šafránek D. 2023. Boolean network sketches:
    A unifying framework for logical model inference. Bioinformatics. 39(4), btad158.'
  mla: 'Beneš, Nikola, et al. “Boolean Network Sketches: A Unifying Framework for
    Logical Model Inference.” <i>Bioinformatics</i>, vol. 39, no. 4, btad158, Oxford
    Academic, 2023, doi:<a href="https://doi.org/10.1093/bioinformatics/btad158">10.1093/bioinformatics/btad158</a>.'
  short: N. Beneš, L. Brim, O. Huvar, S. Pastva, D. Šafránek, Bioinformatics 39 (2023).
date_created: 2023-04-30T22:01:05Z
date_published: 2023-04-03T00:00:00Z
date_updated: 2023-08-01T14:27:28Z
day: '03'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1093/bioinformatics/btad158
ec_funded: 1
external_id:
  isi:
  - '000976610800001'
  pmid:
  - '37004199'
file:
- access_level: open_access
  checksum: 2cb90ddf781baefddf47eac4b54e2a03
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-02T07:39:04Z
  date_updated: 2023-05-02T07:39:04Z
  file_id: '12886'
  file_name: 2023_Bioinformatics_Benes.pdf
  file_size: 478740
  relation: main_file
  success: 1
file_date_updated: 2023-05-02T07:39:04Z
has_accepted_license: '1'
intvolume: '        39'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: Bioinformatics
publication_identifier:
  eissn:
  - 1367-4811
publication_status: published
publisher: Oxford Academic
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://doi.org/10.5281/zenodo.7688740
scopus_import: '1'
status: public
title: 'Boolean network sketches: A unifying framework for logical model inference'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 39
year: '2023'
...
---
_id: '14125'
abstract:
- lang: eng
  text: "Motivation: Recent technological advances have led to an increase in the
    production and availability of single-cell data. The ability to integrate a set
    of multi-technology measurements would allow the identification of biologically
    or clinically meaningful observations through the unification of the perspectives
    afforded by each technology. In most cases, however, profiling technologies consume
    the used cells and thus pairwise correspondences between datasets are lost. Due
    to the sheer size single-cell datasets can acquire, scalable algorithms that are
    able to universally match single-cell measurements carried out in one cell to
    its corresponding sibling in another technology are needed.\r\nResults: We propose
    Single-Cell data Integration via Matching (SCIM), a scalable approach to recover
    such correspondences in two or more technologies. SCIM assumes that cells share
    a common (low-dimensional) underlying structure and that the underlying cell distribution
    is approximately constant across technologies. It constructs a technology-invariant
    latent space using an autoencoder framework with an adversarial objective. Multi-modal
    datasets are integrated by pairing cells across technologies using a bipartite
    matching scheme that operates on the low-dimensional latent representations. We
    evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell
    matches derived by SCIM reflect the same pseudotime on the simulated dataset.
    Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample
    and a human bone marrow sample, where we pair cells from a scRNA dataset to their
    sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy
    for each one of the samples, respectively."
article_processing_charge: No
article_type: original
author:
- first_name: Stefan G
  full_name: Stark, Stefan G
  last_name: Stark
- first_name: Joanna
  full_name: Ficek, Joanna
  last_name: Ficek
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Ximena
  full_name: Bonilla, Ximena
  last_name: Bonilla
- first_name: Stéphane
  full_name: Chevrier, Stéphane
  last_name: Chevrier
- first_name: Franziska
  full_name: Singer, Franziska
  last_name: Singer
- first_name: Rudolf
  full_name: Aebersold, Rudolf
  last_name: Aebersold
- first_name: Faisal S
  full_name: Al-Quaddoomi, Faisal S
  last_name: Al-Quaddoomi
- first_name: Jonas
  full_name: Albinus, Jonas
  last_name: Albinus
- first_name: Ilaria
  full_name: Alborelli, Ilaria
  last_name: Alborelli
- first_name: Sonali
  full_name: Andani, Sonali
  last_name: Andani
- first_name: Per-Olof
  full_name: Attinger, Per-Olof
  last_name: Attinger
- first_name: Marina
  full_name: Bacac, Marina
  last_name: Bacac
- first_name: Daniel
  full_name: Baumhoer, Daniel
  last_name: Baumhoer
- first_name: Beatrice
  full_name: Beck-Schimmer, Beatrice
  last_name: Beck-Schimmer
- first_name: Niko
  full_name: Beerenwinkel, Niko
  last_name: Beerenwinkel
- first_name: Christian
  full_name: Beisel, Christian
  last_name: Beisel
- first_name: Lara
  full_name: Bernasconi, Lara
  last_name: Bernasconi
- first_name: Anne
  full_name: Bertolini, Anne
  last_name: Bertolini
- first_name: Bernd
  full_name: Bodenmiller, Bernd
  last_name: Bodenmiller
- first_name: Ximena
  full_name: Bonilla, Ximena
  last_name: Bonilla
- first_name: Ruben
  full_name: Casanova, Ruben
  last_name: Casanova
- first_name: Stéphane
  full_name: Chevrier, Stéphane
  last_name: Chevrier
- first_name: Natalia
  full_name: Chicherova, Natalia
  last_name: Chicherova
- first_name: Maya
  full_name: D'Costa, Maya
  last_name: D'Costa
- first_name: Esther
  full_name: Danenberg, Esther
  last_name: Danenberg
- first_name: Natalie
  full_name: Davidson, Natalie
  last_name: Davidson
- first_name: Monica-Andreea Dră
  full_name: gan, Monica-Andreea Dră
  last_name: gan
- first_name: Reinhard
  full_name: Dummer, Reinhard
  last_name: Dummer
- first_name: Stefanie
  full_name: Engler, Stefanie
  last_name: Engler
- first_name: Martin
  full_name: Erkens, Martin
  last_name: Erkens
- first_name: Katja
  full_name: Eschbach, Katja
  last_name: Eschbach
- first_name: Cinzia
  full_name: Esposito, Cinzia
  last_name: Esposito
- first_name: André
  full_name: Fedier, André
  last_name: Fedier
- first_name: Pedro
  full_name: Ferreira, Pedro
  last_name: Ferreira
- first_name: Joanna
  full_name: Ficek, Joanna
  last_name: Ficek
- first_name: Anja L
  full_name: Frei, Anja L
  last_name: Frei
- first_name: Bruno
  full_name: Frey, Bruno
  last_name: Frey
- first_name: Sandra
  full_name: Goetze, Sandra
  last_name: Goetze
- first_name: Linda
  full_name: Grob, Linda
  last_name: Grob
- first_name: Gabriele
  full_name: Gut, Gabriele
  last_name: Gut
- first_name: Detlef
  full_name: Günther, Detlef
  last_name: Günther
- first_name: Martina
  full_name: Haberecker, Martina
  last_name: Haberecker
- first_name: Pirmin
  full_name: Haeuptle, Pirmin
  last_name: Haeuptle
- first_name: Viola
  full_name: Heinzelmann-Schwarz, Viola
  last_name: Heinzelmann-Schwarz
- first_name: Sylvia
  full_name: Herter, Sylvia
  last_name: Herter
- first_name: Rene
  full_name: Holtackers, Rene
  last_name: Holtackers
- first_name: Tamara
  full_name: Huesser, Tamara
  last_name: Huesser
- first_name: Anja
  full_name: Irmisch, Anja
  last_name: Irmisch
- first_name: Francis
  full_name: Jacob, Francis
  last_name: Jacob
- first_name: Andrea
  full_name: Jacobs, Andrea
  last_name: Jacobs
- first_name: Tim M
  full_name: Jaeger, Tim M
  last_name: Jaeger
- first_name: Katharina
  full_name: Jahn, Katharina
  last_name: Jahn
- first_name: Alva R
  full_name: James, Alva R
  last_name: James
- first_name: Philip M
  full_name: Jermann, Philip M
  last_name: Jermann
- first_name: André
  full_name: Kahles, André
  last_name: Kahles
- first_name: Abdullah
  full_name: Kahraman, Abdullah
  last_name: Kahraman
- first_name: Viktor H
  full_name: Koelzer, Viktor H
  last_name: Koelzer
- first_name: Werner
  full_name: Kuebler, Werner
  last_name: Kuebler
- first_name: Jack
  full_name: Kuipers, Jack
  last_name: Kuipers
- first_name: Christian P
  full_name: Kunze, Christian P
  last_name: Kunze
- first_name: Christian
  full_name: Kurzeder, Christian
  last_name: Kurzeder
- first_name: Kjong-Van
  full_name: Lehmann, Kjong-Van
  last_name: Lehmann
- first_name: Mitchell
  full_name: Levesque, Mitchell
  last_name: Levesque
- first_name: Sebastian
  full_name: Lugert, Sebastian
  last_name: Lugert
- first_name: Gerd
  full_name: Maass, Gerd
  last_name: Maass
- first_name: Markus
  full_name: Manz, Markus
  last_name: Manz
- first_name: Philipp
  full_name: Markolin, Philipp
  last_name: Markolin
- first_name: Julien
  full_name: Mena, Julien
  last_name: Mena
- first_name: Ulrike
  full_name: Menzel, Ulrike
  last_name: Menzel
- first_name: Julian M
  full_name: Metzler, Julian M
  last_name: Metzler
- first_name: Nicola
  full_name: Miglino, Nicola
  last_name: Miglino
- first_name: Emanuela S
  full_name: Milani, Emanuela S
  last_name: Milani
- first_name: Holger
  full_name: Moch, Holger
  last_name: Moch
- first_name: Simone
  full_name: Muenst, Simone
  last_name: Muenst
- first_name: Riccardo
  full_name: Murri, Riccardo
  last_name: Murri
- first_name: Charlotte KY
  full_name: Ng, Charlotte KY
  last_name: Ng
- first_name: Stefan
  full_name: Nicolet, Stefan
  last_name: Nicolet
- first_name: Marta
  full_name: Nowak, Marta
  last_name: Nowak
- first_name: Patrick GA
  full_name: Pedrioli, Patrick GA
  last_name: Pedrioli
- first_name: Lucas
  full_name: Pelkmans, Lucas
  last_name: Pelkmans
- first_name: Salvatore
  full_name: Piscuoglio, Salvatore
  last_name: Piscuoglio
- first_name: Michael
  full_name: Prummer, Michael
  last_name: Prummer
- first_name: Mathilde
  full_name: Ritter, Mathilde
  last_name: Ritter
- first_name: Christian
  full_name: Rommel, Christian
  last_name: Rommel
- first_name: María L
  full_name: Rosano-González, María L
  last_name: Rosano-González
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
- first_name: Natascha
  full_name: Santacroce, Natascha
  last_name: Santacroce
- first_name: Jacobo Sarabia del
  full_name: Castillo, Jacobo Sarabia del
  last_name: Castillo
- first_name: Ramona
  full_name: Schlenker, Ramona
  last_name: Schlenker
- first_name: Petra C
  full_name: Schwalie, Petra C
  last_name: Schwalie
- first_name: Severin
  full_name: Schwan, Severin
  last_name: Schwan
- first_name: Tobias
  full_name: Schär, Tobias
  last_name: Schär
- first_name: Gabriela
  full_name: Senti, Gabriela
  last_name: Senti
- first_name: Franziska
  full_name: Singer, Franziska
  last_name: Singer
- first_name: Sujana
  full_name: Sivapatham, Sujana
  last_name: Sivapatham
- first_name: Berend
  full_name: Snijder, Berend
  last_name: Snijder
- first_name: Bettina
  full_name: Sobottka, Bettina
  last_name: Sobottka
- first_name: Vipin T
  full_name: Sreedharan, Vipin T
  last_name: Sreedharan
- first_name: Stefan
  full_name: Stark, Stefan
  last_name: Stark
- first_name: Daniel J
  full_name: Stekhoven, Daniel J
  last_name: Stekhoven
- first_name: Alexandre PA
  full_name: Theocharides, Alexandre PA
  last_name: Theocharides
- first_name: Tinu M
  full_name: Thomas, Tinu M
  last_name: Thomas
- first_name: Markus
  full_name: Tolnay, Markus
  last_name: Tolnay
- first_name: Vinko
  full_name: Tosevski, Vinko
  last_name: Tosevski
- first_name: Nora C
  full_name: Toussaint, Nora C
  last_name: Toussaint
- first_name: Mustafa A
  full_name: Tuncel, Mustafa A
  last_name: Tuncel
- first_name: Marina
  full_name: Tusup, Marina
  last_name: Tusup
- first_name: Audrey Van
  full_name: Drogen, Audrey Van
  last_name: Drogen
- first_name: Marcus
  full_name: Vetter, Marcus
  last_name: Vetter
- first_name: Tatjana
  full_name: Vlajnic, Tatjana
  last_name: Vlajnic
- first_name: Sandra
  full_name: Weber, Sandra
  last_name: Weber
- first_name: Walter P
  full_name: Weber, Walter P
  last_name: Weber
- first_name: Rebekka
  full_name: Wegmann, Rebekka
  last_name: Wegmann
- first_name: Michael
  full_name: Weller, Michael
  last_name: Weller
- first_name: Fabian
  full_name: Wendt, Fabian
  last_name: Wendt
- first_name: Norbert
  full_name: Wey, Norbert
  last_name: Wey
- first_name: Andreas
  full_name: Wicki, Andreas
  last_name: Wicki
- first_name: Bernd
  full_name: Wollscheid, Bernd
  last_name: Wollscheid
- first_name: Shuqing
  full_name: Yu, Shuqing
  last_name: Yu
- first_name: Johanna
  full_name: Ziegler, Johanna
  last_name: Ziegler
- first_name: Marc
  full_name: Zimmermann, Marc
  last_name: Zimmermann
- first_name: Martin
  full_name: Zoche, Martin
  last_name: Zoche
- first_name: Gregor
  full_name: Zuend, Gregor
  last_name: Zuend
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
- first_name: Kjong-Van
  full_name: Lehmann, Kjong-Van
  last_name: Lehmann
citation:
  ama: 'Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching
    with unpaired feature sets. <i>Bioinformatics</i>. 2020;36(Supplement_2):i919-i927.
    doi:<a href="https://doi.org/10.1093/bioinformatics/btaa843">10.1093/bioinformatics/btaa843</a>'
  apa: 'Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer,
    F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired
    feature sets. <i>Bioinformatics</i>. Oxford University Press. <a href="https://doi.org/10.1093/bioinformatics/btaa843">https://doi.org/10.1093/bioinformatics/btaa843</a>'
  chicago: 'Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane
    Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell
    Matching with Unpaired Feature Sets.” <i>Bioinformatics</i>. Oxford University
    Press, 2020. <a href="https://doi.org/10.1093/bioinformatics/btaa843">https://doi.org/10.1093/bioinformatics/btaa843</a>.'
  ieee: 'S. G. Stark <i>et al.</i>, “SCIM: Universal single-cell matching with unpaired
    feature sets,” <i>Bioinformatics</i>, vol. 36, no. Supplement_2. Oxford University
    Press, pp. i919–i927, 2020.'
  ista: 'Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired
    feature sets. Bioinformatics. 36(Supplement_2), i919–i927.'
  mla: 'Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired
    Feature Sets.” <i>Bioinformatics</i>, vol. 36, no. Supplement_2, Oxford University
    Press, 2020, pp. i919–27, doi:<a href="https://doi.org/10.1093/bioinformatics/btaa843">10.1093/bioinformatics/btaa843</a>.'
  short: S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R.
    Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger,
    M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi,
    A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova,
    M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens,
    K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey,
    S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz,
    S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger,
    K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler,
    J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G.
    Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S.
    Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli,
    L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González,
    G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan,
    T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan,
    S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski,
    N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S.
    Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid,
    S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann,
    Bioinformatics 36 (2020) i919–i927.
date_created: 2023-08-21T12:28:20Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2023-09-11T10:21:00Z
day: '01'
department:
- _id: FrLo
doi: 10.1093/bioinformatics/btaa843
extern: '1'
external_id:
  pmid:
  - '33381818'
intvolume: '        36'
issue: Supplement_2
keyword:
- Computational Mathematics
- Computational Theory and Mathematics
- Computer Science Applications
- Molecular Biology
- Biochemistry
- Statistics and Probability
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1093/bioinformatics/btaa843
month: '12'
oa: 1
oa_version: Published Version
page: i919-i927
pmid: 1
publication: Bioinformatics
publication_identifier:
  eissn:
  - 1367-4811
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/ratschlab/scim
scopus_import: '1'
status: public
title: 'SCIM: Universal single-cell matching with unpaired feature sets'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2020'
...
