1) constrained sequence alignment
带约束的序列比对
1.
In this paper,two conditions to slove the constrained sequence alignment problem are demonstrated theoretically when the penalty factor φ in the distance function is 0.
通过理论证明,得出了当距离函数中惩罚因子φ=0时的解应满足的条件,并在此基础上改进两种最长公共子序列的优化算法,使之能够求解出带约束的序列比对问题。
3) constrained longest common subsequence
带约束最长公共子序列
1.
A fast algorithm of constrained longest common subsequence
带约束最长公共子序列快速算法
4) unconstrained sequence
无约束序列
5) sequences of constraint
约束度序列
6) Constrained signaling frequency hopping sequence
受约束的信令跳变序列
补充资料：带约
1.比喻众水汇聚一溪。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条