Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Second Uniqueness Theorem01:16

Second Uniqueness Theorem

1.1K
Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the...
1.1K
Law of Independent Assortment02:03

Law of Independent Assortment

56.1K
While Mendel’s Law of Segregation states that the two alleles for one gene are separated into different gametes, a different question of how different genes are inherited remains. For example, is the gene for tall plants inherited with the gene for green peas? Mendel asked this question by experimenting with a dihybrid cross; a cross in which both parents are homozygous for two distinct traits resulting in an F1 generation that are heterozygous for both traits.
56.1K
The Availability Heuristic01:08

The Availability Heuristic

6.1K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
6.1K
Heuristics01:21

Heuristics

120
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
120
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

779
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
779
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.2K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Bridging the Scales via Personalized Cellular Modeling and Deep Phenotyping in Schizophrenia.

JAMA psychiatry·2026
Same author

Genetic interactions, synthetic lethality and complexity in cancer vulnerability mapping-Insights and perspectives from the 2nd EuroDepMap symposium.

FEBS letters·2026
Same author

Tau uptake by human neurons depends on receptor LRP1 and kinase LRRK2.

The EMBO journal·2025
Same author

The synthetic lethal interaction between CDS1 and CDS2 is a vulnerability in uveal melanoma and across multiple tumor types.

Nature genetics·2025
Same author

Integrative ensemble modelling of cetuximab sensitivity in colorectal cancer patient-derived xenografts.

Nature communications·2024
Same author

Author Correction: A benchmark of computational methods for correcting biases of established and unknown origin in CRISPR-Cas9 screening data.

Genome biology·2024
Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026
Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026
Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Aug 13, 2025

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.2K

A heuristic algorithm solving the mutual-exclusivity-sorting problem.

Alessandro Vinceti1, Lucia Trastulla1, Umberto Perron1

  • 1Computational Biology Research Centre, Human Technopole, 20157 Milano, Italy.

Bioinformatics (Oxford, England)
|January 20, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces MutExMatSorting, an R package that efficiently sorts binary matrices to reveal mutual exclusivity patterns in cancer genomics data. It outperforms existing tools for identifying gene co-mutation trends and potential therapeutic targets.

More Related Videos

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.6K

Related Experiment Videos

Last Updated: Aug 13, 2025

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.6K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.6K

Area of Science:

  • Computational biology
  • Genomics
  • Bioinformatics

Background:

  • Binary matrices are crucial for representing genetic aberrations in cancer research.
  • Mutual exclusivity trends in gene mutations can identify cancer drivers and inform therapy design.
  • Existing tools lack efficient methods for sorting matrices to visualize these trends.

Purpose of the Study:

  • To formalize the mutual-exclusivity-sorting problem.
  • To present MutExMatSorting, an R package for efficient binary matrix sorting.
  • To highlight mutual-exclusivity patterns in cancer genomic data.

Main Methods:

  • Developed a computationally efficient algorithm for sorting binary matrix rows and columns.
  • The algorithm minimizes vertical overlap and maximizes adjacent non-zero entries.
  • Implemented the algorithm in the R package MutExMatSorting.

Main Results:

  • MutExMatSorting effectively highlights mutual-exclusivity patterns.
  • The algorithm outperforms existing tools in sorting binary matrices for this purpose.
  • Demonstrated the package's ability to identify combinatorial relations among genetic aberrations.

Conclusions:

  • MutExMatSorting provides a robust and efficient solution for analyzing mutual exclusivity in cancer genomics.
  • The package aids in identifying cancer driver networks and designing combinatorial therapies.
  • This tool enhances the visualization and analysis of complex genomic data.