代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/233815/14133840
m subseq_count.m
function [result, K] = subseq_count(s,t,p)
%SUBSEQ_COUNT
% Finds the non-contiguous subsequence match count between strings s and t
% by implementing a dynamic matrix, where the length
www.eeworm.com/read/233815/14133864
m p_trie.m
function ans = p_trie(s,t,p)
%P_TRIE
% -Finds the contiguous subsequence match count between strings s and t
% by using a depth-first traversal on a retrieval trie,
% where the
www.eeworm.com/read/233815/14133872
m blended_spectrum.m
function [result, K_p] = blended_spectrum(s,t,p,lambda)
%BLENDED_SPECTRUM
% -Finds the contiguous subsequence match count between strings s and t
% by using a dynamic programming implem
www.eeworm.com/read/442927/7641709
m lccs.m
function [lccscount, lccs_path, lccs_str, lccstable] = lccs(a, b)
%LCCS Longest (maximum) common consecutive subsequence
% Usage:
% [count, lccs_path, lccs_str, lccstable] = lccs(a, b)
% a: input
www.eeworm.com/read/233815/14133874
m blended_spectrum_bf.m
function [result] = blended_spectrum_bf(s,t,p)
%BLENDED_SPECTRUM_BF
% -Finds the contiguous subsequence match count between strings s and t
% by using a brute-force approach, for all su
www.eeworm.com/read/233815/14133877
m blended_spectrum_fast.m
function [result, K_p] = blended_spectrum_fast(s,t,p,lambda)
%BLENDED_SPECTRUM_FAST
% -Finds the contiguous subsequence match count between strings s and t
% by using a dynamic programm
www.eeworm.com/read/293917/3927431
cpp fig02_05.cpp
/**
* Cubic maximum contiguous subsequence sum algorithm.
*/
int maxSubSum1( const vector & a )
{
int maxSum = 0;
for( int i = 0; i < a.size( ); i++ )
for( int j = i; j
www.eeworm.com/read/293917/3927446
cpp fig02_08.cpp
/**
* Linear-time maximum contiguous subsequence sum algorithm.
*/
int maxSubSum4( const vector & a )
{
int maxSum = 0, thisSum = 0;
for( int j = 0; j < a.size( ); j++ )
{
www.eeworm.com/read/233815/14133844
m p_spectrum_bf.m
function [result] = p_spectrum_bf(s,t,p)
%P_SPECTRUM_BF
% -Finds the contiguous subsequence match count between strings s and t
% by using a brute-force approach, where the length of th
www.eeworm.com/read/474814/1390525
g demo3.g
subsequence power( exponent )
{
whenever self->compute do
self->ready( $value ^ exponent )
}
square := power( 2 )
cube := power( 3 )
square->compute( 6 )
cube->compute( [2, 5, 10.1] )
wheneve