期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
THE MATRIX ITERATION ALGORITHM SOLVING AN ENUMERATION PROBLEM ON BACTERIAL COMPLETE GENOMES
1
作者 YANGHuakang HUANGChengxiang WENXiaowei 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第2期220-236,共17页
Given an alphabet ∑ and a finite minimal set B of forbidden words,a combinatorial enumeration problem on bacterial complete genomes is transformed to enumerating strings of a given length which do not contain any str... Given an alphabet ∑ and a finite minimal set B of forbidden words,a combinatorial enumeration problem on bacterial complete genomes is transformed to enumerating strings of a given length which do not contain any string in B as their substrings.From the fact that a string in the language is equivalent to a path in the corresponding graph,we have obtained a polynomial time algorithm by modifying the power of the adjacency matrix in the graph. 展开更多
关键词 bacterial complete genome alphabet Σ minimal set B of forbidden words L^k L_(x_i x_j)~k and L_(x_i x_j)~k (for all x_i x_j Σ) matrix l^((k)) (k 1) adjacencymatrix
原文传递
具非孤立奇点的映射芽的右等价 被引量:1
2
作者 姜广峰 《数学学报(中文版)》 SCIE CSCD 北大核心 1995年第4期518-528,共11页
本文先给出了两映射芽是C_j-等价的充要条件,然后用C_J-等价和R_I-等价理论给出了具有非孤立奇点的映射芽的M-确定性的几个充分条件。
关键词 非孤立奇点 映射芽 CJ等价 右等价 RI等价
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部