代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/442927/7641978
m editdistance - 複製.m
function [minDist, edPath, edStr, edTable] = editDistance(a, b, substituteCost, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, edPath, edStr, edTable] = lcsm(a, b, plotOpt)
%
www.eeworm.com/read/442927/7641701
m lcs.m
function [lcsCount, lcsPath, lcsStr, lcsTable] = lcs(a, b, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, lcsPath, lcsStr, lcsTable] = lcsm(a, b, plotOpt)
% a: input string 1
www.eeworm.com/read/442927/7641707
m lcs.m
function [lcscount, lcsPath, lcsStr, lcsTable] = lcs(a, b, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, lcsPath, lcsStr, lcsTable] = lcsm(a, b, plotOpt)
% a: input string 1
www.eeworm.com/read/442927/7641981
m lcsm.m
function [lcsCount, lcsPath, lcsStr, lcsTable] = lcs(a, b, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, lcsPath, lcsStr, lcsTable] = lcsm(a, b, plotOpt)
% a: input string 1
www.eeworm.com/read/442927/7641997
m lcsm1.m
function [lcsCount, lcsPath, lcsStr, lcsTable] = lcs(a, b, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, lcsPath, lcsStr, lcsTable] = lcsm(a, b, plotOpt)
% a: input string 1
www.eeworm.com/read/442927/7642015
m lcsm2.m
function [lcsCount, lcsPath, lcsStr, lcsTable] = lcs(a, b, plotOpt)
%lcs: Longest (maximum) common subsequence
% Usage: [count, lcsPath, lcsStr, lcsTable] = lcsm(a, b, plotOpt)
% a: input string 1
www.eeworm.com/read/125133/6032930
gen-combos2
some pseudocode for now:
read in the basic blocks and their counts
for each basic block:
for each subsequence:
increment its count by the basic block's count
while not done:
pick the (op, ops)
www.eeworm.com/read/125133/6033110
gen-combos2
some pseudocode for now:
read in the basic blocks and their counts
for each basic block:
for each subsequence:
increment its count by the basic block's count
while not done:
pick the (op, ops)
www.eeworm.com/read/111083/15518983
html lcom_subseq.html
Data Structures and Algorithms: Longest Common Subsequence
www.eeworm.com/read/281000/10273881
cpp fig02_07.cpp
/**
* Recursive maximum contiguous subsequence sum algorithm.
* Finds maximum sum in subarray spanning a[left..right].
* Does not attempt to maintain actual best sequence.
*/
int maxSumRec( c