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 ...
随机推荐
- QT5下的caffe项目属性
TEMPLATE = app CONFIG += console c++11 CONFIG -= app_bundle CONFIG -= qt SOURCES += /home/aimhabo/ca ...
- Eclipse自动生成方法注释 快捷键
自动生成方法的注释格式,例如 /*** @param str* @return* @throws ParseException*/ 快捷键是 ALT + SHIFT + J,将光标放在方法名上,按快捷 ...
- 【Finchley】【新特性】Spring Cloud Finchley 新特性
Finchley 正式版的发布貌似经历了相当长的时间,这次的重大发布主要带来了以下 4 项重大更新. 重大更新 1.新增 Spring Cloud Gateway 组件 Spring Cloud Ga ...
- how do I get the difference between two R named lists?
aa<- list(a=1, b="two", c=list(3, "four")) bb <- list(a=1, c=list(3, " ...
- Get and Set Column/Row Names for Data Frames
row.names(x)row.names(x) <- value rownames(x, do.NULL = TRUE, prefix = "row") rownames( ...
- [bzoj 4196][NOI 2015]软件包管理器
大概算是一道模板题吧? 就是细节有点多 罗列一下: 如果习惯从1开始搞树的编号的话,处理输入进来的那个依赖关系在加边的时候两个都要+1,体现在代码就是i要从2枚举到n,然后输入进来的那个数要+1 这道 ...
- SQL中的字母的大小写转换
http://blog.csdn.net/dxb601/article/details/52086830 update 表名 set 字段名a= Lower(字段a) 2.将小写字母转化成大写字母 ...
- 题解——UVA11997 K Smallest Sums
题面 背景 输入 输出 翻译(渣自翻) 给定K个包含K个数字的表,要求将其能产生的\( k^{k} \)个值中最小的K个输出出来 题解 k路归并问题的经典问题 可以转化为二路归并问题求解 考虑A[], ...
- Images之Dockerfile中的命令1
Dockerfile reference Docker can build images automatically by reading the instructions from a Docker ...
- Ubuntu 安装 matplotlib
参考: ubuntu16 安装matplotlib Ubuntu 安装 matplotlib sudo apt-get install libpng-dev libfreetype6-dev pkg- ...