longestConsecutive        package:matchprobes        R Documentation

_O_b_t_a_i_n _t_h_e _l_e_n_g_t_h _o_f _t_h_e _l_o_n_g_e_s_t _s_u_b_s_t_r_i_n_g _c_o_n_t_a_i_n_i_n_g
_o_n_l_y '_l_e_t_t_e_r'

_D_e_s_c_r_i_p_t_i_o_n:

     This function accepts a character vector and computes the length
     of the longest substring containing only 'letter' for each element
     of 'x'.

_U_s_a_g_e:

     longestConsecutive(seq, letter) 

_A_r_g_u_m_e_n_t_s:

     seq: Character vector.

  letter: Character vector of length 1, containing one single
          character.

_D_e_t_a_i_l_s:

     The elements of 'x' can be in upper case, lower case or mixed. NAs
     are handled.

_V_a_l_u_e:

     An integer vector of the same length as 'x'.

_A_u_t_h_o_r(_s):

     W. Huber

_S_e_e _A_l_s_o:

     'complementSeq','basecontent','reverseSeq'

_E_x_a_m_p_l_e_s:

      v = c("AAACTGTGFG", "GGGAATT", "CCAAAAAAAAAATT")
      longestConsecutive(v, "A")