Multiple sequence alignment Benchmark Data set
Multiple sequence alignment Benchmark Data set
1. 汇总: 序列比对标准数据集: http://www.drive5.com/bench/

This is a collection of multiple alignment benchmarks in a uniform
format that is convenient for further analysis. All files are in
FASTA format, with upper-case letters used to indicate aligned
columns.
See References below for original sources of benchmark data.
Benchmarks are:
--------------------------1---------------------------
bali2dna
BALIBASE v2, reverse-translated to DNA
bali2dnaf
Bali2dbn, with frame-shifts induced by random insertions of one
or two nucleotides into the middle 50% of exactly one sequence
in each set.
bali3
BALIBASE v3.
bali3pdb
BALIS, the structural subset of BALIBASE v3.
bali3pdbm
MU-BALIS, i.e. BALIS re-aligned by MUSTANG.
---------------------------2--------------------------
ox
OXBENCH.
oxm
MU-OXBENCH, i.e. OXBENCH re-aligned by MUSTANG.
oxx
OXBENCH-X, i.e. the Extended set in OBENCH.
---------------------------3--------------------------
prefab4
PREFAB v4.
prefab4ref
PREFAB-R, i.e. the pair-wise reference pairs in PREFAB v4.
prefab4refm
MU-PREFAB-R, i.e. PREFAB-R re-aligned by MUSTANG.
---------------------------4--------------------------
sabre
Consistent multiple alignments constructed from SABMARK v1.65.
sabrem
MU-SABRE, i.e. SABRE re-aligned by MUSTANG.
-----------------------------------------------------
Directory structure under each benchmark is:
in/
Input sequences.
ref/
Reference alignments. Upper-case regions indicate conservative
regions that are intended for use in assessment. Lower-case regions
should not be used.
info/
Contains ids.txt (list of set identifiers that are filenames in ref/
and in/), nrseqs.txt (number of sequences in each set), and
pctids.txt (%id in conservative regions in each set).
Download page for qscore :http://www.drive5.com/bench/bench.tar.gz
This is a quality scoring program that compares two multiple sequence alignments: an alignment to be evaluated (the "test" alignment) and a second alignment that is believed to be correct (the "reference" alignment). The program outputs the following scores:
- The PREFAB Q score (aka the Balibase SPS score or the Developer score).
- The Modeler score
- The Cline et al. shift score
- The Balibase TC (total column) score
Balibase标准数据库地址: http://www.lbgi.fr/balibase/

References
----------
Thompson JD, Koehl P, Ripp R, Poch O (2005) BAliBASE 3.0: latest
developments of the multiple sequence alignment benchmark. Proteins
61: 127-136.
Bahr A, Thompson JD, Thierry JC, Poch O (2001) BAliBASE (Benchmark
Alignment dataBASE): enhancements for repeats, transmembrane
sequences and circular permutations. Nucleic Acids Res 29: 323-326.
Thompson JD, Plewniak F, Poch O (1999) BAliBASE: a benchmark
alignment database for the evaluation of multiple alignment programs.
Bioinformatics 15: 87-88.
Van Walle I, Lasters I, Wyns L (2005) SABmark--a benchmark for
sequence alignment that covers the entire known fold space.
Bioinformatics 21: 1267-1268.
Raghava GP, Searle SM, Audley PC, Barber JD, Barton GJ (2003)
OXBench: a benchmark for evaluation of protein multiple sequence
alignment accuracy. BMC Bioinformatics 4: 47.
Edgar RC (2004) MUSCLE: multiple sequence alignment with high
accuracy and high throughput. Nucleic Acids Res 32: 1792-1797.
Multiple sequence alignment Benchmark Data set的更多相关文章
- [Sequence Alignment Methods] Dynamic time warping (DTW)
本系列介绍几种序列对齐方法,包括Dynamic time warping (DTW),Smith–Waterman algorithm,Cross-recurrence plot Dynamic ti ...
- [Sequence Alignment Methods] Cross-Recurrent Plot (CRP)
A recurrence plot (RP) is a straightforward way to visualize characteristics of similar system state ...
- [Sequence Alignment Methods] Smith–Waterman algorithm
Smith–Waterman algorithm 首先需要澄清一个事实,Smith–Waterman algorithm是求两个序列的最佳subsequence匹配,与之对应的算法但是求两个序列整体匹 ...
- INTRODUCTION TO BIOINFORMATICS
INTRODUCTION TO BIOINFORMATICS 这套教程源自Youtube,算得上比较完整的生物信息学领域的视频教程,授课内容完整清晰,专题化的讲座形式,细节讲解比国内的京师大 ...
- Bioinformatics Glossary
原文:http://homepages.ulb.ac.be/~dgonze/TEACHING/bioinfo_glossary.html Affine gap costs: A scoring sys ...
- 三代PacBio reads纠错 - 专题
三代纠错的重要性不言而喻,三代的核心优势就是长,唯一的缺点就是错误率高,但好就好在错误是随机分布的,可以通过算法解决,这也就是为什么现在有这么多针对三代开发的纠错工具. 纠错和组装是分不开的,纠错就是 ...
- Difference between Hard Clip(H) and Soft Clip(S) in Samtools CIGAR string
一般人都知道 H 和 S 的表面上的区别,即 S 就是 soft, H 就是 hard,S 后,序列里还是会保留序列的信息,而 H 则不会. ----------------------------- ...
- SOAPdenovo组装软件使用记录
背景: 1.为什么要从头测序组装基因组? 基因组是不同表型的遗传基础:获得参考基因组是深入研究一个生物体全基因组的第一步也是必须的一步:从头测序组装能够对新的测序物种构建参考基因组: 2.为什么要研究 ...
- 序列比对之Biostrings包
基本概念 Biostrings包很重要的3个功能是进行Pairwise sequence alignment 和Multiple sequence alignment及 Pattern finding ...
随机推荐
- IntelliJ_编译一直报错“找不到符号”
执行maven compile时一直报错"找不到符号",类 XXX 各种clean.compile都不行 最后执行Rebuild Project一次后解决 执行rebuild ...
- 【NOIP 2015 & SDOI 2016 Round1 & CTSC 2016 & SDOI2016 Round2】游记
我第一次写游记,,,, 正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪里?正文在哪 ...
- Hessian Matrix
函数\(f\)的Hessian矩阵由是由它的二阶偏导数组成的方阵 \[ H = \begin{bmatrix} \dfrac{\partial^2 f}{\partial x_1^2} & \ ...
- hdu4725最短路变形 添加点
The Shortest Path in Nya Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K ...
- SpringMVC 参数传递
使用@RequestParam 注解获取GET请求或POST请求提交的参数: 获取Cookie的值:使用@CookieValue : 根据不同的Web请求方法,映射到不同的处理方法:使用登陆页面作示例 ...
- 提供RESTful服务
RESTful广泛运用于互联网服务,而在企业应用中,大部分场景仍然是RPC服务,这是由于企业应用的业务复杂性造成的.但是基于SOAP的RPC服务也存在很多的弊端,比如服务异步处理比较麻烦,大部分RPC ...
- java.net.URL请求远程文件下载
1:浏览器请求下载 public void listStockcodeUplaod(HttpServletRequest req, HttpServletResponse res) throws Ex ...
- .VDI manual Technical Logistics - Volume 2: Industrial Trucks
VDI manual Technical Logistics - Volume 2: Industrial Trucks Name Publication date: State VDI 2196 B ...
- AS技巧合集「常用技巧篇」
转载:http://www.apkbus.com/forum.php?mod=viewthread&tid=254723&extra=page%3D2%26filter%3Dautho ...
- 【BZOJ-2893】征服王 最大费用最大流(带下界最小流)
2893: 征服王 Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 156 Solved: 48[Submit][Status][Discuss] D ...