omnigenome 0.3.0a1__py3-none-any.whl → 0.3.3a0__py3-none-any.whl

omnigenome/src/model/rna_design/model.py

@@ -1,469 +0,0 @@
-# -*- coding: utf-8 -*-
-# file: model.py
-# author: YANG, HENG <hy345@exeter.ac.uk> (杨恒)
-# github: https://github.com/yangheng95
-# huggingface: https://huggingface.co/yangheng
-# google scholar: https://scholar.google.com/citations?user=NPq5a_0AAAAJ&hl=en
-# Copyright (C) 2019-2024. All Rights Reserved.
-"""
-RNA design model using masked language modeling and evolutionary algorithms.
-
-This module provides an RNA design model that combines masked language modeling
-with evolutionary algorithms to design RNA sequences that fold into specific
-target structures. It uses a multi-objective optimization approach to balance
-structure similarity and thermodynamic stability.
-"""
-import random
-import numpy as np
-import torch
-import autocuda
-from transformers import AutoModelForMaskedLM, AutoTokenizer
-from concurrent.futures import ProcessPoolExecutor, as_completed
-import ViennaRNA
-from scipy.spatial.distance import hamming
-import warnings
-import os
-
-from omnigenome.src.misc.utils import fprint
-
-
-class OmniModelForRNADesign(torch.nn.Module):
-    """
-    RNA design model using masked language modeling and evolutionary algorithms.
-    
-    This model combines a pre-trained masked language model with evolutionary
-    algorithms to design RNA sequences that fold into specific target structures.
-    It uses a multi-objective optimization approach to balance structure similarity
-    and thermodynamic stability.
-    
-    Attributes:
-        device: Device to run the model on (CPU or GPU)
-        parallel: Whether to use parallel processing for structure prediction
-        tokenizer: Tokenizer for processing RNA sequences
-        model: Pre-trained masked language model
-    """
-    
-    def __init__(
-        self,
-        model="yangheng/OmniGenome-186M",
-        device=None,
-        parallel=False,
-        *args,
-        **kwargs,
-    ):
-        """
-        Initialize the RNA design model.
-        
-        Args:
-            model (str): Model name or path for the pre-trained MLM model
-            device: Device to run the model on (default: None, auto-detect)
-            parallel (bool): Whether to use parallel processing (default: False)
-            *args: Additional positional arguments
-            **kwargs: Additional keyword arguments
-        """
-        super().__init__(*args, **kwargs)
-        self.device = autocuda.auto_cuda() if device is None else device
-        self.parallel = parallel
-        self.tokenizer = AutoTokenizer.from_pretrained(model)
-        self.model = AutoModelForMaskedLM.from_pretrained(model, trust_remote_code=True)
-        self.model.to(self.device).to(torch.float16)
-
-    @staticmethod
-    def _random_bp_span(bp_span=None):
-        """
-        Generate a random base pair span.
-        
-        Args:
-            bp_span (int, optional): Fixed base pair span. If None, generates random.
-            
-        Returns:
-            int: Base pair span value
-        """
-        if bp_span is None:
-            return random.randint(1, 10)
-        return bp_span
-
-    @staticmethod
-    def _longest_bp_span(structure):
-        """
-        Find the longest base pair span in the structure.
-        
-        Args:
-            structure (str): RNA structure in dot-bracket notation
-            
-        Returns:
-            int: Length of the longest base pair span
-        """
-        max_span = 0
-        current_span = 0
-        
-        for char in structure:
-            if char == "(":
-                current_span += 1
-                max_span = max(max_span, current_span)
-            elif char == ")":
-                current_span = max(0, current_span - 1)
-            else:
-                current_span = 0
-                
-        return max_span
-
-    @staticmethod
-    def _predict_structure_single(sequence, bp_span=-1):
-        """
-        Predict structure for a single sequence (worker function for multiprocessing).
-        
-        Args:
-            sequence (str): RNA sequence to fold
-            bp_span (int): Base pair span parameter
-            
-        Returns:
-            tuple: (structure, mfe) tuple
-        """
-        try:
-            return ViennaRNA.fold(sequence)
-        except Exception as e:
-            warnings.warn(f"Failed to fold sequence {sequence}: {e}")
-            return ("." * len(sequence), 0.0)
-
-    def _predict_structure(self, sequences, bp_span=-1):
-        """
-        Predict structures for multiple sequences.
-        
-        Args:
-            sequences (list): List of RNA sequences
-            bp_span (int): Base pair span parameter
-            
-        Returns:
-            list: List of (structure, mfe) tuples
-        """
-        if not self.parallel or len(sequences) <= 1:
-            # Sequential processing
-            return [self._predict_structure_single(seq, bp_span) for seq in sequences]
-        
-        # Parallel processing with improved error handling
-        try:
-            # Determine number of workers
-            max_workers = min(os.cpu_count(), len(sequences), 8)  # Limit to 8 workers
-            
-            with ProcessPoolExecutor(max_workers=max_workers) as executor:
-                # Submit all tasks
-                future_to_seq = {
-                    executor.submit(self._predict_structure_single, seq, bp_span): seq 
-                    for seq in sequences
-                }
-                
-                # Collect results
-                results = []
-                for future in as_completed(future_to_seq):
-                    try:
-                        result = future.result()
-                        results.append(result)
-                    except Exception as e:
-                        seq = future_to_seq[future]
-                        warnings.warn(f"Failed to process sequence {seq}: {e}")
-                        # Fallback to dot structure
-                        results.append(("." * len(seq), 0.0))
-                
-                return results
-                
-        except Exception as e:
-            warnings.warn(f"Parallel processing failed, falling back to sequential: {e}")
-            # Fallback to sequential processing
-            return [self._predict_structure_single(seq, bp_span) for seq in sequences]
-
-    def _init_population(self, structure, num_population):
-        """
-        Initialize the population with random sequences.
-        
-        Args:
-            structure (str): Target RNA structure
-            num_population (int): Population size
-            
-        Returns:
-            list: List of (sequence, bp_span) tuples
-        """
-        population = []
-        bp_span = self._longest_bp_span(structure)
-        
-        for _ in range(num_population):
-            # Generate random sequence
-            sequence = "".join(random.choice("ACGU") for _ in range(len(structure)))
-            population.append((sequence, bp_span))
-            
-        return population
-
-    def _mlm_mutate(self, population, structure, mutation_ratio):
-        """
-        Mutate population using masked language modeling.
-        
-        Args:
-            population (list): Current population
-            structure (str): Target RNA structure
-            mutation_ratio (float): Ratio of tokens to mutate
-            
-        Returns:
-            list: Mutated population
-        """
-        def mutate(sequence, mutation_rate):
-            # Create masked sequence
-            masked_sequence = list(sequence)
-            num_mutations = int(len(sequence) * mutation_rate)
-            mutation_positions = random.sample(range(len(sequence)), num_mutations)
-            
-            for pos in mutation_positions:
-                masked_sequence[pos] = self.tokenizer.mask_token
-                
-            return "".join(masked_sequence)
-        
-        # Prepare inputs for MLM
-        mlm_inputs = []
-        for sequence, bp_span in population:
-            masked_seq = mutate(sequence, mutation_ratio)
-            mlm_inputs.append(masked_seq)
-        
-        # Get predictions from MLM
-        predicted_tokens = self._mlm_predict(mlm_inputs, structure)
-        
-        # Convert predictions back to sequences
-        mutated_population = []
-        for i, (sequence, bp_span) in enumerate(population):
-            # Convert token IDs back to nucleotides
-            new_sequence = self.tokenizer.decode(predicted_tokens[i], skip_special_tokens=True)
-            # Ensure the sequence has the correct length
-            if len(new_sequence) != len(structure):
-                new_sequence = new_sequence[:len(structure)].ljust(len(structure), "A")
-            mutated_population.append((new_sequence, bp_span))
-            
-        return mutated_population
-
-    def _crossover(self, population, num_points=3):
-        """
-        Perform crossover operation on the population.
-        
-        Args:
-            population (list): Current population
-            num_points (int): Number of crossover points
-            
-        Returns:
-            list: Population after crossover
-        """
-        if len(population) < 2:
-            return population
-            
-        # Create crossover masks
-        num_sequences = len(population)
-        masks = np.zeros((num_sequences, len(population[0][0])), dtype=bool)
-        
-        # Generate random crossover points
-        crossover_points = np.random.randint(0, len(population[0][0]), (num_sequences, num_points))
-        
-        # Create parent indices
-        parent_indices = np.random.randint(0, num_sequences, (num_sequences, 2))
-        
-        # Generate crossover masks
-        for i in range(num_sequences):
-            for j in range(num_points):
-                if j == 0:
-                    masks[i, :crossover_points[i, j]] = True
-                else:
-                    last_point = crossover_points[i, j-1]
-                    masks[i, last_point:crossover_points[i, j]] = j % 2 == 0
-                    
-            # Handle the last segment
-            last_point = crossover_points[i, -1]
-            masks[i, last_point:] = num_points % 2 == 0
-
-        # Perform crossover
-        population_array = np.array([list(seq[0]) for seq in population])
-        child1_array = np.where(
-            masks,
-            population_array[parent_indices[:, 0]],
-            population_array[parent_indices[:, 1]],
-        )
-        child2_array = np.where(
-            masks,
-            population_array[parent_indices[:, 1]],
-            population_array[parent_indices[:, 0]],
-        )
-
-        return [
-            ("".join(child), bp_span)
-            for child, (_, bp_span) in zip(child1_array, population)
-        ] + [
-            ("".join(child), bp_span)
-            for child, (_, bp_span) in zip(child2_array, population)
-        ]
-
-    def _evaluate_structure_fitness(self, sequences, structure):
-        """
-        Evaluate the fitness of the RNA structure by comparing with the target structure.
-        
-        Args:
-            sequences (list): List of (sequence, bp_span) tuples to evaluate
-            structure (str): Target RNA structure
-            
-        Returns:
-            list: Sorted population with fitness scores and MFE values
-        """
-        # Get sequences for structure prediction
-        seq_list = [seq for seq, _ in sequences]
-        
-        # Predict structures (with improved multiprocessing)
-        structures_mfe = self._predict_structure(seq_list)
-
-        sorted_population = []
-        for (seq, bp_span), (ss, mfe) in zip(sequences, structures_mfe):
-            score = hamming(list(structure), list(ss))
-            sorted_population.append((seq, bp_span, score, mfe))
-
-        fronts = self._non_dominated_sorting(
-            [x[2] for x in sorted_population], [x[3] for x in sorted_population]
-        )
-        return self._select_next_generation(sorted_population, fronts)
-
-    @staticmethod
-    def _non_dominated_sorting(scores, mfe_values):
-        """
-        Perform non-dominated sorting for multi-objective optimization.
-        
-        Args:
-            scores (list): Structure similarity scores
-            mfe_values (list): Minimum free energy values
-            
-        Returns:
-            list: List of fronts (Pareto fronts)
-        """
-        num_solutions = len(scores)
-        domination_count = [0] * num_solutions
-        dominated_solutions = [[] for _ in range(num_solutions)]
-        fronts = [[]]
-
-        for p in range(num_solutions):
-            for q in range(num_solutions):
-                if scores[p] < scores[q] and mfe_values[p] < mfe_values[q]:
-                    dominated_solutions[p].append(q)
-                elif scores[q] < scores[p] and mfe_values[q] < mfe_values[p]:
-                    domination_count[p] += 1
-
-            if domination_count[p] == 0:
-                fronts[0].append(p)
-
-        i = 0
-        while len(fronts[i]) > 0:
-            next_front = []
-            for p in fronts[i]:
-                for q in dominated_solutions[p]:
-                    domination_count[q] -= 1
-                    if domination_count[q] == 0:
-                        next_front.append(q)
-            i += 1
-            fronts.append(next_front)
-
-        if not fronts[-1]:  # Ensure the last front is not empty before removing
-            fronts.pop(-1)
-
-        return fronts
-
-    @staticmethod
-    def _select_next_generation(next_generation, fronts):
-        """
-        Select the next generation based on Pareto fronts.
-        
-        Args:
-            next_generation (list): Current population with fitness scores
-            fronts (list): Pareto fronts
-            
-        Returns:
-            list: Selected population for the next generation
-        """
-        sorted_population = []
-        for front in fronts:
-            front_population = [next_generation[i] for i in front]
-            sorted_population.extend(front_population)
-            if len(sorted_population) >= len(next_generation):
-                break
-
-        return sorted_population[: len(next_generation)]
-
-    def _mlm_predict(self, mlm_inputs, structure):
-        """
-        Perform masked language model prediction.
-        
-        Args:
-            mlm_inputs (list): List of masked input sequences
-            structure (str): Target RNA structure
-            
-        Returns:
-            list: Predicted token IDs for each input
-        """
-        batch_size = 8
-        all_outputs = []
-
-        with torch.no_grad():
-            for i in range(0, len(mlm_inputs), batch_size):
-                inputs = self.tokenizer(
-                    mlm_inputs[i: i + batch_size],
-                    padding=False,
-                    max_length=1024,
-                    truncation=True,
-                    return_tensors="pt",
-                )
-                inputs = {
-                    key: value.to(self.model.device) for key, value in inputs.items()
-                }
-                outputs = self.model(**inputs)[0].argmax(dim=-1)
-                all_outputs.append(outputs)
-
-        return torch.cat(all_outputs, dim=0)[:, 1 : 1 + len(structure)]
-
-    def design(
-        self, structure, mutation_ratio=0.5, num_population=100, num_generation=100
-    ):
-        """
-        Design RNA sequences for a target structure using evolutionary algorithms.
-        
-        Args:
-            structure (str): Target RNA structure in dot-bracket notation
-            mutation_ratio (float): Ratio of tokens to mutate (default: 0.5)
-            num_population (int): Population size (default: 100)
-            num_generation (int): Number of generations (default: 100)
-            
-        Returns:
-            list: List of designed RNA sequences with their fitness scores
-        """
-        population = self._init_population(structure, num_population)
-        population = self._mlm_mutate(population, structure, mutation_ratio)
-
-        for generation_id in range(num_generation):
-            next_generation = self._crossover(population)
-            next_generation = self._mlm_mutate(
-                next_generation, structure, mutation_ratio
-            )
-            next_generation = self._evaluate_structure_fitness(
-                next_generation, structure
-            )[:num_population]
-
-            candidate_sequences = [
-                seq for seq, bp_span, score, mfe in next_generation if score == 0
-            ]
-            if candidate_sequences:
-                return candidate_sequences
-
-            population = [
-                (seq, bp_span) for seq, bp_span, score, mfe in next_generation
-            ]
-
-        return population[0][0]
-
-
-# Example usage
-if __name__ == "__main__":
-    model = OmniModelForRNADesign(model="anonymous8/OmniGenome-186M")
-    best_sequence = model.design(
-        structure="(((....)))",
-        mutation_ratio=0.5,
-        num_population=100,
-        num_generation=100,
-    )
-    fprint(f"Best RNA sequence: {best_sequence}")

omnigenome/src/model/seq2seq/__init__.py

@@ -1,12 +0,0 @@
-# -*- coding: utf-8 -*-
-# file: __init__.py
-# time: 22:21 08/04/2024
-# author: YANG, HENG <hy345@exeter.ac.uk> (杨恒)
-# github: https://github.com/yangheng95
-# huggingface: https://huggingface.co/yangheng
-# google scholar: https://scholar.google.com/citations?user=NPq5a_0AAAAJ&hl=en
-# Copyright (C) 2019-2024. All Rights Reserved.
-"""
-This package contains modules for sequence-to-sequence models.
-"""
-

omnigenome/src/model/seq2seq/model.py

@@ -1,44 +0,0 @@
-# -*- coding: utf-8 -*-
-# file: model.py
-# time: 11:40 14/04/2024
-# author: YANG, HENG <hy345@exeter.ac.uk> (杨恒)
-# github: https://github.com/yangheng95
-# huggingface: https://huggingface.co/yangheng
-# google scholar: https://scholar.google.com/citations?user=NPq5a_0AAAAJ&hl=en
-# Copyright (C) 2019-2024. All Rights Reserved.
-"""
-Sequence-to-sequence model for genomic sequences.
-
-This module provides a sequence-to-sequence model implementation for genomic
-sequences. It's designed for tasks where the input and output are both
-sequences, such as sequence translation, structure prediction, or sequence
-transformation tasks.
-"""
-
-from ...abc.abstract_model import OmniModel
-
-
-class OmniModelForSeq2Seq(OmniModel):
-    """
-    Sequence-to-sequence model for genomic sequences.
-    
-    This model implements a sequence-to-sequence architecture for genomic
-    sequences, where the input is one sequence and the output is another
-    sequence. It's useful for tasks like sequence translation, structure
-    prediction, or sequence transformation.
-    
-    The model can be extended to implement specific seq2seq tasks by
-    overriding the forward, predict, and inference methods.
-    """
-    
-    def __init__(self, config_or_model, tokenizer, *args, **kwargs):
-        """
-        Initialize the sequence-to-sequence model.
-        
-        Args:
-            config_or_model: Model configuration or pre-trained model
-            tokenizer: Tokenizer for processing input sequences
-            *args: Additional positional arguments
-            **kwargs: Additional keyword arguments
-        """
-        super().__init__(config_or_model, tokenizer, *args, **kwargs)

omnigenome/src/tokenizer/__init__.py

@@ -1,16 +0,0 @@
-# -*- coding: utf-8 -*-
-# file: __init__.py
-# time: 18:05 08/04/2024
-# author: YANG, HENG <hy345@exeter.ac.uk> (杨恒)
-# github: https://github.com/yangheng95
-# huggingface: https://huggingface.co/yangheng
-# google scholar: https://scholar.google.com/citations?user=NPq5a_0AAAAJ&hl=en
-# Copyright (C) 2019-2024. All Rights Reserved.
-"""
-This package contains tokenizer implementations.
-"""
-
-
-from .bpe_tokenizer import OmniBPETokenizer
-from .kmers_tokenizer import OmniKmersTokenizer
-from .single_nucleotide_tokenizer import OmniSingleNucleotideTokenizer