A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/cobalt_8hpp_source.html below:

NCBI C++ ToolKit: include/algo/cobalt/cobalt.hpp Source File

1 #ifndef ALGO_COBALT___COBALT__HPP 2 #define ALGO_COBALT___COBALT__HPP 85

eLastStatus = eOutOfMemory

173  void

SetInputMSAs(

const

objects::CSeq_align& msa1,

174  const

objects::CSeq_align& msa2,

182  const

vector< CRef<objects::CSeq_loc> >&

GetQueries

(

void

)

const 183 

{

return

m_tQueries;}

256 

{

return

m_Clusterer.GetClusters();}

272 

FInterruptFn SetInterruptCallback(FInterruptFn fnptr,

273  void

* user_data =

NULL

);

284  const

vector<string>&

GetMessages

(

void

)

const

{

return

m_Messages;}

289  bool IsMessage

(

void

)

const

{

return

!m_Messages.empty();}

310  bool

x_ValidateQueries(

void

)

const

;

315  bool

x_ValidateInputMSAs(

void

)

const

;

321  bool

x_ValidateUserHits(

void

);

332

vector<int>& indices);

342  void

x_CreatePatternQueries(vector<const CSequence*>& queries,

343

vector<int>& indices);

353  const

vector<int>& indices);

363  const

vector<int>& indices);

371  void

x_FindLocalInClusterHits(

const

vector<TPhyTreeNode*>& cluster_trees);

380  void

x_FindPatternHits(

const

vector<const CSequence*>& queries,

381  const

vector<int>& indices);

386  void

x_FindConsistentHitSubset(

void

);

393  void

x_ComputeTree();

400  void

x_BuildAlignment();

407  bool

x_FindQueryClusters();

411  void

x_AlignInClusters();

416  void

x_MakeClusterResidueFrequencies();

421  void

x_MultiAlignClusters();

427  void

x_ComputeClusterTrees(vector<TPhyTreeNode*>& trees);

436  void

x_AttachClusterTrees(

const

vector<TPhyTreeNode*>& cluster_trees,

437  const

vector<TPhyTreeNode*>& cluster_leaves);

448  void

x_BuildFullTree(

const

vector<TPhyTreeNode*>& cluster_trees);

457  virtual void

x_Run(

void

);

461  void

x_AlignMSAs(

void

);

478  const

vector<int>& indices,

479  const

objects::CBlast4_archive& archive);

490

: seq_index(s), range(

r

) {}

492

: seq_index(s), range(from, to) {}

500  static const int

kRpsScaleFactor = 100;

513

: hit(h), list_pos(list_pos),

514

path_next(0), best_score(0.0) {}

518  class

compare_sseg_db_idx;

524  return a

.seq_index <

b

.seq_index;

559 

fReduceBoth = fReduceLeft | fReduceRight

565  void

x_InitParams(

void

);

568  void

x_InitAligner(

void

);

580

{m_Interrupt =

NULL

;}

582  void

x_LoadBlockBoundaries(

string

blockfile,

583

vector<SSegmentLoc>& blocklist);

585  const

vector<int>& indices,

CHitList

& rps_hits);

587  void

x_RealignBlocks(

CHitList

& rps_hits,

588

vector<SSegmentLoc>& blocklist,

590  void

x_AssignRPSResFreqs(

CHitList

& rps_hits,

592  void

x_AssignDefaultResFreqs();

597

vector<SSegmentLoc>& seg_list,

600  void

x_MakeFillerBlocks(

const

vector<int>& indices,

602

vector<SSegmentLoc>& filler_segs);

605  const

vector<int>& indices,

607

vector<SSegmentLoc>& filler_segs);

609  void

x_FindAlignmentSubsets();

610

SGraphNode * x_FindBestPath(vector<SGraphNode>& nodes);

612  void

x_BuildAlignmentIterative(vector<CTree::STreeEdge>& edges,

613  double

cluster_cutoff);

614  void

x_FindConservedColumns(vector<CSequence>& new_alignment,

617

vector<CSequence>& query_data,

619  int

iteration,

bool

is_cluster);

620  double

x_RealignSequences(

const TPhyTreeNode

*input_cluster,

621

vector<CSequence>& alignment,

626

vector<CTree::STreeLeaf>& node_list2,

627

vector<CSequence>& alignment,

636  void

x_AlignProfileProfileUsingHit(vector<CTree::STreeLeaf>& node_list1,

637

vector<CTree::STreeLeaf>& node_list2,

638

vector<CSequence>& alignment,

641  void

x_FindConstraints(vector<size_t>& constraint,

642

vector<CSequence>& alignment,

643

vector<CTree::STreeLeaf>& node_list1,

644

vector<CTree::STreeLeaf>& node_list2,

647  void

x_FindInClusterConstraints(vector<CSequence>& alignment,

648

vector<CTree::STreeLeaf>& node_list1,

649

vector<CTree::STreeLeaf>& node_list2,

651

vector<TRangePair>& match_ranges)

const

;

652  double

x_GetScoreOneCol(vector<CSequence>& align,

654  double

x_GetScore(vector<CSequence>& align);

657

vector<int>& indices)

const

;

659  static void

x_InitColumn(vector<SColumn>::iterator& it,

size_t len

);

661  static void

x_InitInsertColumn(vector<SColumn>::iterator& it,

size_t len

,

662  int

num,

int

cluster);

665

vector<CSequence>& query_data,

666  const

vector<TRange>& gaps);

668

unique_ptr< vector<int> > x_AlignClusterQueries(

const TPhyTreeNode

* node);

670  void

x_ComputeProfileRangeAlignment(

671

vector<CTree::STreeLeaf>& node_list1,

672

vector<CTree::STreeLeaf>& node_list2,

673

vector<CSequence>& alignment,

674

vector<size_t>& constraints,

676  int

full_prof_len1,

int

full_prof_len2,

677

EEndGapCostStrategy strat,

747  static const int

kClusterNodeId = 16000;

749  friend

class ::CMultiAlignerTest;

static CRef< CScope > m_Scope

User-defined methods of the data storage class.

User-defined methods of the data storage class.

Multiple aligner exceptions.

Interface for CHit class, used to encapsulate operations involving pairwise alignments.

Definitions used by all COBALT aligner components.

int TOffset

Basic data type for offsets into a sequence.

pair< string, biosample_util::EStatus > TStatus

Interface for CClusterer class used for clustering any type of data based on distance matrix.

vector< TSingleCluster > TClusters

An ordered collection of CHit objects.

A generalized representation of a pairwise alignment.

Test class for accessing CMultiAligner private attributes and methods.

bool operator()(const SSegmentLoc &a, const SSegmentLoc &b) const

Simultaneously align multiple protein sequences.

vector< CSequence > m_AllQueryData

EEndGapCostStrategy

Strategy for reducing end gap penalties for profile-profile alignment.

vector< vector< Uint4 > > m_ClusterGapPositions

CMultiAlignerOptions::EInClustAlnMethod m_ClustAlnMethod

SProgress m_ProgressMonitor

CRef< objects::CScope > m_Scope

CConstRef< CMultiAlignerOptions > GetOptions(void) const

Get mutli aligner parameters.

const vector< CSequence > & GetSeqResults(void) const

Retrieve the current aligned results in CSequence format.

const vector< CRef< objects::CSeq_loc > > & GetQueries(void) const

Get query sequences.

vector< int > m_Msa2Repr

Indices of sequence representatives in input alignment 2.

vector< CRef< objects::CSeq_loc > > m_tQueries

vector< CRef< objects::CSeq_loc > > m_AllQueries

CSparseKmerCounts TKmerCounts

const vector< string > & GetMessages(void) const

Get Error/Warning messages.

CHitList m_LocalInClusterHits

const TPhyTreeNode * GetTree(void) const

Get ree used guide in progressive alignment.

@ eOutOfMemory

Out of memory error.

@ eInternalError

Unexpected error occured.

@ eInterrupt

Alignment interruped through callback function.

@ eOptionsError

Error related to options occured.

@ eDatabaseError

Error related to RPS database occured.

@ eQueriesError

Error related to query sequences occured.

vector< CSequence > m_QueryData

const CClusterer::TClusters & GetQueryClusters(void) const

Get clusters of query sequences.

vector< bool > m_IsDomainSearched

Marks sequences with pre-computed domain hits.

TKmerMethods< TKmerCounts > TKMethods

vector< vector< TRange > > m_RPSLocs

vector< CSequence > m_InMSA1

Input alignment.

vector< CSequence > m_Results

CConstRef< CMultiAlignerOptions > m_Options

int GetScore(void) const

Get alignment score.

vector< string > m_Messages

CRef< objects::CScope > GetScope(void)

Get scope.

int m_Score

Alignment score.

void x_Init(void)

Initiate class attributes that are not alignment parameters.

pair< TRange, TRange > TRangePair

vector< int > m_Msa1Repr

Indices of sequence representatives in input alignment 1.

bool IsMessage(void) const

Check whether there are any error/warning messages.

vector< CSequence > m_InMSA2

Input alignment.

Represent databases of PSSM data and residue frequencies.

Kmer counts for alignment free sequence similarity computation implemented as a sparse vector.

definition of a Culling tree

A wrapper for controlling access to the phylogenetic tree generated by CDistMethods.

Interface for computing and manipulating k-mer counts vectors that allows for different implementatio...

Interface for CDistances class.

const Uint2 kMinorVersion

const Uint2 kMajorVersion

vector< ETranscriptSymbol > TTranscript

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define END_SCOPE(ns)

End the previously defined scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

#define BEGIN_SCOPE(ns)

Define a new scope.

void Run(void)

Enter the main loop.

#define NCBI_COBALT_EXPORT

TTo GetTo(void) const

Get the To member data.

TFrom GetFrom(void) const

Get the From member data.

Interface for CHitList class.

int x_AlignProfileProfile(double **freq1_data, int freq1_size, double **freq2_data, int freq2_size, CPSSMAligner &aligner, bool local_alignment)

void x_SetScoreMatrix(const char *matrix_name, CPSSMAligner &aligner)

static const int kPatchVersion

Defines classes: CDirEntry, CFile, CDir, CSymLink, CMemoryFile, CFileUtil, CFileLock,...

double r(size_t dimension_, const Int4 *score_, const double *prob_, double theta_)

Options for CMultiAligner.

Interface for CProfileData.

Interface for CSequence class.

vector< SSeqLoc > TSeqLocVector

Vector of sequence locations.

Column in an alignment used for combining result from multiple alignment and pair-wise in-cluster ali...

int cluster

cluster index (inserted column only)

bool insert

Is the column an insertion from in-cluster alignment.

int number

number of letters in range (inserted column only)

vector< int > letters

Indices of letters in this column for regular column: index of a letter in input sequence (n-th lette...

double best_score

the score of that optimal path (assumes this node is the first entry in the path)

struct SGraphNode * path_next

the optimal path node belongs to

SGraphNode(CHit *h, int list_pos)

CHit * hit

the alignment represented by this node

Structure for reporting alignment progress.

SSegmentLoc(int s, TRange r)

SSegmentLoc(int s, TOffset from, TOffset to)

Interface for CTree class.


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4