登录
首页 » matlab » sequence-alignment

sequence-alignment

于 2013-01-22 发布 文件大小:250KB
0 264
下载积分: 1 下载次数: 99

代码说明:

  基于动态规划算法的蛋白质序列比对 Needleman-Wunsch Smith-Waterman(protein sequence alignment Needleman-Wunsch Smith-Waterman)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • BFS
    广度优先搜索算法,做了很详细的解释,大家可以有空学习交流下。(Breadth-first search algorithm, and made a very detailed explanation, you can free exchange under studying. )
    2014-11-04 21:31:16下载
    积分:1
  • rub
    该程序主要完成jeffcott转子圆周碰摩故障仿真,包括设置初始条件,转子系统参数等(rub-impacting of rotor)
    2015-06-21 18:22:20下载
    积分:1
  • SSL
    说明:  二维空间声源定位算法实现,短小精悍,一看就会(Implementation of FPGA-based two-dimensional spatial sound source localization algorithm)
    2020-10-19 20:50:30下载
    积分:1
  • mu-fisher
    基于mu节律能量的140组脑电信号的决策分类,从3s到9s之间不同决策时间点的识别率,最高为85 (140 mu rhythm-based energy group decision-making EEG classification, from 3s to 9s different decision points in time between the recognition rate up to 85 )
    2011-04-19 20:04:30下载
    积分:1
  • 石墨烯电导率(已知弛豫时间)
    说明:  描述了石墨烯电导率与弛豫时间的关系,谐振波长与基底折射率的关系。(The relationship between the conductivity of graphene and the relaxation time, the relationship between the resonance wavelength and the refractive index of the substrate are described.)
    2020-06-06 13:59:37下载
    积分:1
  • MatlabSingleProcessing
    Matlab信号处理指导电子书,分数字信号处理工具箱、阵列信号处理工具箱和时频分析工具箱三大部分分别详解且均有实例,全书351page,很不错的matlab信号处理教程。(Matlab Single Processing)
    2009-07-19 19:51:51下载
    积分:1
  • EMD
    EMD分解,可以有效的解决EMD分解问题,并嫩而过画出希尔伯特谱(EMD decomposition, can effectively solve the problem of EMD and tender and had drawn Hilbert spectrum)
    2013-07-15 14:56:30下载
    积分:1
  • matlabtutorial
    matlab教程,详细介绍matlab的入门到精通的过程(matlab tutorials matlab detail the process of entry to the master)
    2010-05-14 16:35:29下载
    积分:1
  • zw_sinwel-2177771-SymofTurboQPSK
    说明:  Turbo码QPSK调制的matlab仿真,可运行(Matlab simulation of Turbo code QPSK modulation, it can run)
    2019-12-30 19:43:33下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载