graph.de.bruijn            package:igraph            R Documentation

_D_e _B_r_u_i_j_n _g_r_a_p_h_s.

_D_e_s_c_r_i_p_t_i_o_n:

     De Bruijn graphs are labeled graphs representing the overlap of
     strings.

_U_s_a_g_e:

     graph.de.bruijn(m,n)

_A_r_g_u_m_e_n_t_s:

       m: Integer scalar, the size of the alphabet. See details below.

       n: Integer scalar, the length of the labels. See details below.

_D_e_t_a_i_l_s:

     A de Bruijn graph represents relationships between strings. An
     alphabet of 'm' letters are used and strings of length 'n' are
     considered.  A vertex corresponds to every possible string and
     there is a directed edge from vertex 'v' to vertex 'w' if the
     string of 'v' can be transformed into the string of 'w' by
     removing its first letter and appending a letter to it.

     Please note that the graph will have 'm' to the power 'n' vertices
     and even more edges, so probably you don't want to supply too big
     numbers for 'm' and 'n'.

     De Bruijn graphs have some interesting properties, please see
     another source, eg. Wikipedia for details.

_V_a_l_u_e:

     A graph object.

_A_u_t_h_o_r(_s):

     Gabor Csardi <csardi@rmki.kfki.hu>

_S_e_e _A_l_s_o:

     'graph.kautz', 'line.graph'

_E_x_a_m_p_l_e_s:

     # de Bruijn graphs can be created recursively by line graphs as well 
     g <- graph.de.bruijn(2,1)
     graph.de.bruijn(2,2)
     line.graph(g)

