![]() |
Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
|
Generic Forest Edit Distance algorithm for ordered forests. More...
#include <Ordered_forest_edit_distance.hpp>
Public Types | |
enum | Edition_type { NULL_EDITION , INSERTION , DELETION , MORPHING } |
typedef T_Ordered_forest_edit_distance< Forest, GetCost, IsLowerSiblingVertex > | Self |
typedef GetCost::FT | FT |
Number type of the cost. More... | |
typedef boost::graph_traits< Forest > | Forest_traits |
typedef Forest_traits::vertex_descriptor | Vertex |
typedef boost::tuple< Edition_type, Vertex, Vertex, FT > | Edit_unit_path |
Representation of a unitary edition: type of edition, source vertex, target vertex, cost. More... | |
Public Member Functions | |
FT | operator() (const Forest &F1, const Forest &F2, const GetCost &get_cost=GetCost(), const IsLowerSiblingVertex &is_lower_sibling1=IsLowerSiblingVertex(), const IsLowerSiblingVertex &is_lower_sibling2=IsLowerSiblingVertex()) |
template<class OutputIterator > | |
OutputIterator | operator() (const Forest &F1, const Forest &F2, OutputIterator out, const GetCost &get_cost=GetCost(), const IsLowerSiblingVertex &is_lower_sibling1=IsLowerSiblingVertex(), const IsLowerSiblingVertex &is_lower_sibling2=IsLowerSiblingVertex()) |
Generic Forest Edit Distance algorithm for ordered forests.
Forest | Model of a forest as a directed or bidirectional boost::adjacency_list. |
typedef boost::tuple<Edition_type, Vertex, Vertex, FT> Edit_unit_path |
Representation of a unitary edition: type of edition, source vertex, target vertex, cost.
typedef boost::graph_traits<Forest> Forest_traits |
typedef GetCost::FT FT |
Number type of the cost.
typedef T_Ordered_forest_edit_distance<Forest, GetCost, IsLowerSiblingVertex> Self |
typedef Forest_traits::vertex_descriptor Vertex |
enum Edition_type |
|
inline |
|
inline |