DNA sequence open reading frames (ORFs) | DNA序列的开放阅读框ORF预测
常见的ORF预测工具
Open Reading Frame Finder- NCBI
ORF Finder - SMS
OrfPredictor - YSU
基本概念
开放阅读框(英语:Open reading frame;缩写:ORF;其他译名:开放阅读框架、开放读架等)是指在给定的阅读框架中,不包含终止密码子的一串序列。这段序列是生物个体的基因组中,可能作为蛋白质编码序列的部分。基因中的ORF包含并位于开始编码与终止编码之间。由于一段DNA或RNA序列有多种不同读取方式,因此可能同时存在许多不同的开放阅读框架。有一些计算机程序可分析出最可能是蛋白质编码的序列。
关键词:
1. 不包含终止密码子的一串序列;
2. 可能作为蛋白质编码序列的部分;
3. 有多种不同读取方式,因此可能同时存在许多不同的开放阅读框架;
4. 有些工具会用blast比对来提高可信度
示例
一段5'-UCUAAAGGUCCA-3'序列。此序列共有3种读取法:
- UCU AAA GGU CCA
- CUA AAG GUC
- UAA AGG UCC
由于UAA为终止编码,因此第三种读取法不具编译出蛋白质的潜力,故只有前两者为开放阅读框架
个人当然是推荐使用NCBI大佬开发的工具的啦,发文章可信度高些。
以下是Linux版该工具的说明:
USAGE
ORFfinder [-h] [-help] [-xmlhelp] [-in Input_File] [-id Accession_GI]
[-b begin] [-e end] [-c circular] [-g Genetic_code] [-s Start_codon]
[-ml minimal_length] [-n nested_ORFs] [-strand Strand] [-out Output_File]
[-outfmt output_format] [-logfile File_Name] [-conffile File_Name]
[-version] [-version-full] [-dryrun] DESCRIPTION
Searching open reading frames in a sequence OPTIONAL ARGUMENTS
-h
Print USAGE and DESCRIPTION; ignore all other parameters
-help
Print USAGE, DESCRIPTION and ARGUMENTS; ignore all other parameters
-xmlhelp
Print USAGE, DESCRIPTION and ARGUMENTS in XML format; ignore all other
parameters
-logfile <File_Out>
File to which the program log should be redirected
-conffile <File_In>
Program's configuration (registry) data file
-version
Print version number; ignore other arguments
-version-full
Print extended version data; ignore other arguments
-dryrun
Dry run the application: do nothing, only test all preconditions *** Input query options (one of them has to be provided):
-in <File_In>
name of file with the nucleotide sequence in FASTA format
(more than one sequence is allowed)
Default = `'
-id <String>
Accession or gi number of the nucleotide sequence
(ignored, if the file name is provided)
Default = `' *** Query sequence details:
-b <Integer>
Start address of sequence fragment to be processed
Default = `1'
-e <Integer>
Stop address of sequence fragment to be processed (0 - to the end of the
sequence)
Default = `0'
-c <Boolean>
Is the sequence circular? (t/f) *** Under development
Default = `false' *** Search parameters:
-g <Integer>
Genetic code to use (1-31)
see https://www.ncbi.nlm.nih.gov/Taxonomy/Utils/wprintgc.cgi for details
Default = `1'
-s <Integer>
ORF start codon to use:
0 = "ATG" only
1 = "ATG" and alternative initiation codons
2 = any sense codon
Default = `1'
-ml <Integer>
Minimal length of the ORF (nt)
Value less than 30 is automatically changed by 30.
Default = `75'
-n <Boolean>
Ignore nested ORFs (completely placed within another)
Default = `false'
-strand <String>
Output ORFs on specified strand only (both|plus|minus)
Default = `both' *** Output options:
-out <File_Out>
Output file name
-outfmt <Integer>
Output options:
0 = list of ORFs in FASTA format
1 = CDS in FASTA format
2 = Text ASN.1
3 = Feature table
Default = `0'
ORFfinder -in in.fasta -s 2 -ml 100 -out test.out -outfmt 3
DNA sequence open reading frames (ORFs) | DNA序列的开放阅读框ORF预测的更多相关文章
- HDU 1560 DNA sequence(DNA序列)
HDU 1560 DNA sequence(DNA序列) Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K ...
- POJ 2778 DNA Sequence (AC自己主动机 + dp)
DNA Sequence 题意:DNA的序列由ACTG四个字母组成,如今给定m个不可行的序列.问随机构成的长度为n的序列中.有多少种序列是可行的(仅仅要包括一个不可行序列便不可行).个数非常大.对10 ...
- hdu 1560 DNA sequence(迭代加深搜索)
DNA sequence Time Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total ...
- poj2778 DNA Sequence【AC自动机】【矩阵快速幂】
DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19991 Accepted: 7603 Des ...
- Hdu1560 DNA sequence(IDA*) 2017-01-20 18:53 50人阅读 评论(0) 收藏
DNA sequence Time Limit : 15000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total ...
- POJ2278 DNA Sequence —— AC自动机 + 矩阵优化
题目链接:https://vjudge.net/problem/POJ-2778 DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Tota ...
- HDU1560 DNA sequence
题目: The twenty-first century is a biology-technology developing century. We know that a gene is made ...
- 【HDU - 1560】DNA sequence (dfs+回溯)
DNA sequence 直接中文了 题目描述 21世纪是生物科技飞速发展的时代.我们都知道基因是由DNA组成的,而DNA的基本组成单位是A,C,G,T.在现代生物分子计算中,如何找到DNA之间的最长 ...
- DNA sequence(映射+BFS)
Problem Description The twenty-first century is a biology-technology developing century. We know tha ...
随机推荐
- 20145204张亚军——web安全基础实践
web安全基础实践 实验后回答问题 1.SQL注入原理,如何防御 SQL注入:就是通过把SQL命令插入到"Web表单递交"或"输入域名"或"页面请求& ...
- Jordan 块的几何
设 $V$ 是复数域 $\mathbb{C}$ 上的 $n$ 维线性空间, $\varphi$ 是 $V$ 上的线性变换, $A\in M_n(\mathbb{C})$ 是 $\varphi$ 在某组 ...
- CentOS6.8下安装mysql
转自https://blog.csdn.net/jeffleo/article/details/53559712?utm_source=itdadao&utm_medium=referral ...
- log4j2的配置及使用
log4j2与log4j1的不同点(不完整): 前者配置文件格式多样性.log4j2的配置文件可以是xml,也可以是json. 在不修改web.xml的前提下,前者配置文件的命名可以为log4j2.x ...
- Provinces of China
https://en.wikipedia.org/wiki/Provinces_of_China#Province
- topcoder srm 687 div1
1.$A_{1}=2,A_{2}=3,A_{n}=A_{n-2}+A_{n-1}-1$.给出数字$n$,将其表示成若干个$A$中的不同元素的和. 思路:设$B_{n}=A_{n}-1$,那么有$B_{ ...
- POJ 3264 Balanced Lineup (线段树查找最大最小值)
http://poj.org/problem?id=3264 题意:给你一个长度为n的序列a[N] (1 ≤ N ≤ 50000),询问Q(1 ≤ Q ≤ 200000) 次,每次输出[L, R]区间 ...
- Docker Tomcat远程部署到容器
一:创建一个开启远程部署的tomcat容器 tomcat角色配置 1.tomcat开启远程部署,修改conf/tomcat-users.xml <?xml version="1.0&q ...
- hihoCoder week19 RMQ问题再临-线段树 单点更新 区间查询
单点更新 区间查询 #include <bits/stdc++.h> using namespace std; #define m ((l+r)/2) #define ls (rt< ...
- hihoCoder week11 树中的最长路
题目链接: https://hihocoder.com/contest/hiho11/problem/1 求树中节点对 距离最远的长度 #include <bits/stdc++.h> u ...