Suppr超能文献

接近最优序列比对的可视化。

Visualization of near-optimal sequence alignments.

作者信息

Smoot Michael E, Guerlain Stephanie A, Pearson William R

机构信息

Department of Systems and Information Engineering, University of Virginia, Charlottesville, VA 22908, USA.

出版信息

Bioinformatics. 2004 Apr 12;20(6):953-8. doi: 10.1093/bioinformatics/bth013. Epub 2004 Jan 29.

Abstract

MOTIVATION

Mathematically optimal alignments do not always properly align active site residues or well-recognized structural elements. Most near-optimal sequence alignment algorithms display alternative alignment paths, rather than the conventional residue-by-residue pairwise alignment. Typically, these methods do not provide mechanisms for finding effectively the most biologically meaningful alignment in the potentially large set of options.

RESULTS

We have developed Web-based software that displays near optimal or alternative alignments of two protein or DNA sequences as a continuous moving picture. A WWW interface to a C++ program generates near optimal alignments, which are sent to a Java Applet, which displays them in a series of alignment frames. The Applet aligns residues so that consistently aligned regions remain at a fixed position on the display, while variable regions move. The display can be stopped to examine alignment details.

摘要

动机

数学上最优的比对并不总是能正确地比对活性位点残基或公认的结构元件。大多数接近最优的序列比对算法显示的是替代比对路径,而非传统的逐个残基的两两比对。通常,这些方法没有提供在潜在的大量选项中有效找到最具生物学意义的比对的机制。

结果

我们开发了基于网络的软件,该软件将两个蛋白质或DNA序列的接近最优或替代比对显示为连续动画。一个到C++程序的万维网接口生成接近最优的比对,这些比对被发送到一个Java小程序,该小程序在一系列比对框架中显示它们。该小程序对残基进行比对,以便持续比对的区域在显示上保持固定位置,而可变区域则移动。可以停止显示以检查比对细节。

相似文献

1
Visualization of near-optimal sequence alignments.接近最优序列比对的可视化。
Bioinformatics. 2004 Apr 12;20(6):953-8. doi: 10.1093/bioinformatics/bth013. Epub 2004 Jan 29.
3
SQUARE--determining reliable regions in sequence alignments.SQUARE——确定序列比对中的可靠区域。
Bioinformatics. 2004 Apr 12;20(6):974-5. doi: 10.1093/bioinformatics/bth032. Epub 2004 Feb 5.
9
Multiple sequence alignment with user-defined constraints at GOBICS.在GOBICS中进行具有用户定义约束的多序列比对。
Bioinformatics. 2005 Apr 1;21(7):1271-3. doi: 10.1093/bioinformatics/bti142. Epub 2004 Nov 16.

本文引用的文献

1
Judgment under Uncertainty: Heuristics and Biases.《不确定性下的判断:启发式与偏差》
Science. 1974 Sep 27;185(4157):1124-31. doi: 10.1126/science.185.4157.1124.
4
On near-optimal alignments of biological sequences.关于生物序列的近似最优比对。
J Comput Biol. 1994 Winter;1(4):349-66. doi: 10.1089/cmb.1994.1.349.
5
Identification of common molecular subsequences.常见分子子序列的鉴定
J Mol Biol. 1981 Mar 25;147(1):195-7. doi: 10.1016/0022-2836(81)90087-5.
6
An improved algorithm for matching biological sequences.一种用于匹配生物序列的改进算法。
J Mol Biol. 1982 Dec 15;162(3):705-8. doi: 10.1016/0022-2836(82)90398-9.
8
Improved tools for biological sequence comparison.用于生物序列比较的改进工具。
Proc Natl Acad Sci U S A. 1988 Apr;85(8):2444-8. doi: 10.1073/pnas.85.8.2444.
10
Basic local alignment search tool.基本局部比对搜索工具
J Mol Biol. 1990 Oct 5;215(3):403-10. doi: 10.1016/S0022-2836(05)80360-2.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验