faif
|
Two DNA chains with secondary structures. More...
#include <FoldedPair.h>
Public Types | |
typedef boost::scoped_ptr< FoldedMatrix > | FoldedMatrixPtr |
typedef boost::scoped_ptr< FoldedMatrixStrategy > | FoldedMatrixStrategyPtr |
Public Member Functions | |
FoldedPair (const Chain &first_chain, const Chain &second_chain, const EnergyNucleo &energy, unsigned int max_foldings=100) | |
const Chain & | getFirstChain () const |
const Chain & | getSecondChain () const |
EnergyValue | getSecStructEnergy () const |
SecStruct | findInDepth () const |
const SecStructures & | getStructures () const |
std::ostream & | printMatrix (std::ostream &os, int print_width=4) const |
std::ostream & | printStructures (std::ostream &os, int print_width=4) const |
Two DNA chains with secondary structures.
Two DNA chains with secondary structures (created between them as well as the self-secondary structures)
typedef boost::scoped_ptr<FoldedMatrix> faif::dna::FoldedPair::FoldedMatrixPtr |
the support class - holding the matrix with energy and secondary structures
typedef boost::scoped_ptr<FoldedMatrixStrategy> faif::dna::FoldedPair::FoldedMatrixStrategyPtr |
the strategy to access for FoldedMatrix (one or two DNA chains)
|
inline |
accessor
|
inline |
accessor
|
inline |
the second structure energy. Calculated on the first time, when method is called.
|
inline |
single second structure, algorithm search graph in depth
|
inline |
collection of second structures, algorithm search graph in width, the max_foldings parameters restricts the number of structures
|
inline |
print the matrix (for testing and debugging)
|
inline |
print the secondary structures (for testing and debugging)