1605 - Gene recombination Time Limit: 2s Memory Limit: 64MB Submissions: 264 Solved: 46 DESCRIPTION As a gene engineer of a gene engineering project, Enigma encountered a puzzle about gene recombination. It is well known that a gene can be considered…

题目描述 As a gene engineer of a gene engineering project, Enigma encountered a puzzle about gene recombination. It is well known that a gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C,…

简单广搜.4进制对应的10进制数来表示这些状态,总共只有(4^12)种状态. #include<cstdio> #include<cstring> #include<cmath> #include<map> #include<queue> #include<algorithm> using namespace std; ; ]; struct P { int state; int tot; }; queue<P>Q; ch…

思路:直接用优先队列优化bfs. #include<map> #include<queue> #include<vector> #include<cmath> #include<string> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define Maxn 100010 #define in…

1017 - Exact cover 时间限制:15秒 内存限制:128兆 自定评测 5584 次提交 2975 次通过 题目描述 There is an N*M matrix with only 0s and 1s, (1 <= N,M <= 1000). An exact cover is a selection of rows such that every column has a 1 in exactly one of the selected rows. Try to find o…

使用KOBAS进行KEGG pathway和Gene Ontology分析 Article from Blog of Alfred-Feng http://blog.sina.com.cn/u/1706691033 现在使用在线的通路注释,一般使用DAVID.KOBAS等工具.不同的工具可能需要输入不同的基因名或基因编号.下面举例操作一遍. 1 在gprofiler网站进行基因ID转换. 进入网址“http://biit.cs.ut.ee/gprofiler/gconvert.cgi”,选择g:…

使用tophat和cufflinks计算RNA-seq数据的表达水平时,当一个基因在一个样本中有多个表达水平时需要合并它们的表达水平. This code is a solution to collapsing duplicate FPKMs for a gene. CollapseFPKM This code is a solution to collapsing duplicate FPKMs for a gene Problem/Issue: In the cufflinks output…

做基因组注释 先用augustus训练,然后再用maker做基因注释 augustus提供一些训练好的,如果有和你的物种非常接近的,直接用提供的,没有的话再自己训练. 网址: http://bioinf.uni-greifswald.de/augustus/ 老版本下载: http://bioinf.uni-greifswald.de/augustus/binaries/old/ 最后选择下载2.7的 新版本3.2的实在是装不上 太麻烦了!!!!! 下载好后,解压,cd src, sudo ma…

#HUST deb http://mirrors.hust.edu.cn/ubuntu/ xenial main restricted universe multiverse deb http://mirrors.hust.edu.cn/ubuntu/ xenial-security main restricted universe multiverse deb http://mirrors.hust.edu.cn/ubuntu/ xenial-updates main restricted u…

1017 - Exact cover Problem's Link:   http://acm.hust.edu.cn/problem/show/1017 Mean: 给定一个由0-1组成的矩阵,是否能找到一个行的集合,使得集合中每一列都恰好包含一个1 analyse: 初学DLX. 这是DLX处理的最简单的问题,也是模板题. Time complexity: O(n*d) Source code:  #include <stdio.h> #include <string.h> #…