DiffPaSS is a family of high-performance and scalable PyTorch modules for finding optimal one-to-one pairings between two collections of biological sequences, and for performing general graph alignment.
A typical example of the problem DiffPaSS is designed to solve is the following: given two multiple sequence alignments (MSAs) A and B, containing interacting biological sequences, find the optimal one-to-one pairing between the sequences in A and B.
To find an optimal pairing, we can maximize the average mutual
information between columns of the two paired MSAs
(InformationPairing),
or we can maximize the similarity between distance-based
(MirrortreePairing)
or orthology
(BestHitsPairing)
networks constructed from the two MSAs.
DiffPaSS can be used for general graph alignment problems
(GraphAlignment),
where the goal is to find the one-to-one pairing between the nodes of
two weighted graphs that maximizes the similarity between the two
graphs. The user can specify the (dis-)similarity measure to be
optimized, as an arbitrary differentiable function of the adjacency
matrices of the two graphs.
Using this capability, DiffPaSS can be used for finding the optimal one-to-one pairing between two unaligned collections of sequences, if weighted graphs are built in advance from the two collections (for example, using the pairwise Levenshtein distance). This is useful when alignments are not available or reliable.
DiffPaSS optimizes and returns permutation matrices. Hence, its inputs are required to have the same number of sequences. However, DiffPaSS can be used to pair two collections (e.g. MSAs) containing a different number of sequences, by padding the smaller collection with dummy sequences. For multiple sequence alignments, a simple choice is to add dummy sequences consisting entirely of gap symbols. For general graphs, dummy nodes, connected to the other nodes with arbitrary edge weights, can be added to the smaller graph.
Check our paper for details of the DiffPaSS and DiffPaSS-IPA algorithms. Briefly, the main ingredients are as follows:
-
Using “soft” scores that differentiably extend information-theoretic scores between two paired multiple sequence alignments (MSAs), or scores based on sequence similarity or graph similarity measures.
-
The (truncated) Sinkhorn operator for smoothly parametrizing “soft permutations”, and the matching operator for parametrizing real permutations [Mena et al, 2018].
-
A novel and efficient bootstrap technique, motivated by mathematical results and heuristic insights into this smooth optimization process. See the animation below for an illustration.
-
A notion of “robust pairs” that can be used to identify pairs that are consistently found throughout a DiffPaSS bootstrap. These pairs can be used as ground truths in another DiffPaSS run, giving rise to the DiffPaSS-Iterative Pairing Algorithm (DiffPaSS-IPA).
DiffPaSS_bootstrap.mp4
DiffPaSS requires Python 3.7 or later. It is available on PyPI and can
be installed with pip:
python -m pip install diffpassClone this repository on your local machine by running
git clone git@github.com:Bitbol-Lab/DiffPaSS.gitand move inside the root folder. We recommend creating and activating a dedicated conda or virtualenv Python virtual environment. Then, make an editable install of the package:
python -m pip install -e .First, parse your multiple sequence alignments (MSAs) in FASTA format
into a list of tuples (header, sequence) using
read_msa.
from diffpass.msa_parsing import read_msa
# Parse the MSAs into lists of tuples (header, sequence)
msa_A = read_msa("path/to/msa_A.fasta")
msa_B = read_msa("path/to/msa_B.fasta")We assume that the MSAs contain species information in the headers,
which will be used to restrict the pairings to be within the same
species (more generally, “groups”). We need a simple function to extract
the species information from the headers. For instance, if the headers
are in the format >sequence_id|species_name|..., we can use:
def species_name_func(header):
return header.split("|")[1]This function will be used to group the sequences by species:
from diffpass.data_utils import create_groupwise_seq_records
msa_A_by_sp = create_groupwise_seq_records(msa_A, species_name_func)
msa_B_by_sp = create_groupwise_seq_records(msa_B, species_name_func)If one of the MSAs contains sequences from species not present in the other MSA, we can remove these species from both MSAs:
from diffpass.data_utils import remove_groups_not_in_both
msa_A_by_sp, msa_B_by_sp = remove_groups_not_in_both(
msa_A_by_sp, msa_B_by_sp
)If there are species with different numbers of sequences in the two MSAs, we can add dummy sequences to the smaller species to make the number of sequences equal. For example, we can add dummy sequences consisting entirely of gap symbols:
from diffpass.data_utils import pad_msas_with_dummy_sequences
msa_A_by_sp_pad, msa_B_by_sp_pad = pad_msas_with_dummy_sequences(
msa_A_by_sp, msa_B_by_sp
)
species = list(msa_A_by_sp_pad.keys())
species_sizes = list(map(len, msa_A_by_sp_pad.values()))Next, one-hot encode the MSAs using the
one_hot_encode_msa
function.
from diffpass.data_utils import one_hot_encode_msa
device = "cuda" if torch.cuda.is_available() else "cpu"
# Unpack the padded MSAs into a list of records
msa_A_for_pairing = [
rec for recs_this_sp in msa_A_by_sp_pad.values() for rec in recs_this_sp
]
msa_B_for_pairing = [
rec for recs_this_sp in msa_B_by_sp_pad.values() for rec in recs_this_sp
]
# One-hot encode the MSAs and load them to a device
msa_A_oh = one_hot_encode_msa(msa_A_for_pairing, device=device)
msa_B_oh = one_hot_encode_msa(msa_B_for_pairing, device=device)Finally, we can instantiate a class from diffpass.train to find an
optimal pairing between x and y. Here, x and y are MSAs, so we
can look for a pairing that optimizes the mutual information between x
and y. For this, we use
InformationPairing
and the DiffPaSS bootstrapped optimization algorithm. See the tutorials
below for other examples, including for graph alignment when x and y
are weighted adjacency matrices.
from diffpass.train import InformationPairing
information_pairing = InformationPairing(group_sizes=species_sizes).to(device)
bootstrap_results = information_pairing.fit_bootstrap(x, y)The results are stored in a
DiffPaSSResults
container. The lists of (hard) losses and permutations found during the
optimization can be accessed as attributes of the container:
print(f"Final hard loss: {bootstrap_results.hard_losses[-1].item()}")
print(f"Final hard permutations (one permutation per species): {bootstrap_results.hard_perms[-1][-1].item()}")For more details and examples, including the DiffPaSS-IPA variant, see the tutorials.
mutual_information_msa_pairing.ipynb: paired MSA optimization using mutual information in the case of well-known prokaryotic datasets, for which ground truth pairings are given by genome proximity.graph_alignment.ipynb: general graph alignment usingdiffpass.train.GraphAlignment, with an example of aligning two weighted adjacency matrices.
The full documentation is available at https://Bitbol-Lab.github.io/DiffPaSS/.
To cite this work, please refer to the following publication:
@inproceedings{
lupo2024diffpass,
title={{DiffPaSS} -- {D}ifferentiable and scalable pairing of biological sequences using soft scores},
author={Umberto Lupo and Damiano Sgarbossa and Martina Milighetti and Anne-Florence Bitbol},
booktitle={ICLR 2024 Workshop on Generative and Experimental Perspectives for Biomolecular Design},
year={2024},
url={https://openreview.net/forum?id=n5hO5seROB}
}Project developed using nbdev.