#include <OpenMS/CHEMISTRY/ModifiedNASequenceGenerator.h>
◆ ConstRibonucleotidePtr
◆ applyAtMostOneVariableModification_()
Fast implementation of modification placement. No combinatorial placement is needed in this case
- just every site is modified once by each compatible modification. Already modified residues are skipped 
 
 
◆ applyFixedModifications()
Applies fixed modifications to a single NASequence. 
 
 
◆ applyVariableModifications()
  
  | 
        
          | static void applyVariableModifications | ( | const std::set< ConstRibonucleotidePtr > & | var_mods, |  
          |  |  | const NASequence & | seq, |  
          |  |  | Size | max_variable_mods_per_NASequence, |  
          |  |  | std::vector< NASequence > & | all_modified_NASequences, |  
          |  |  | bool | keep_original = true |  
          |  | ) |  |  |  | static | 
 
 
◆ recurseAndGenerateVariableModifiedSequences_()
  
  | 
        
          | static void recurseAndGenerateVariableModifiedSequences_ | ( | const std::vector< int > & | subset_indices, |  
          |  |  | const std::map< int, std::vector< ConstRibonucleotidePtr >> & | map_compatibility, |  
          |  |  | int | depth, |  
          |  |  | const NASequence & | current_NASequence, |  
          |  |  | std::vector< NASequence > & | modified_NASequences |  
          |  | ) |  |  |  | staticprotected | 
 
Recursively generate all combinatorial placements at compatible sites.