• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利：CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

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

立即免费搜索

文件翻译

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

免费翻译文档

深度研究

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

立即免费体验

Parallel computation of multiple biological sequence comparisons.

作者信息

Foulser D E, Core N G

机构信息

Department of Computer Science, Yale University New Haven, Connecticut 06520.

出版信息

Comput Biomed Res. 1990 Aug;23(4):310-31. doi: 10.1016/0010-4809(90)90024-7.

DOI:10.1016/0010-4809(90)90024-7
PMID:2394091
Abstract

A parallel implementation of an efficient method for comparison of multiple DNA sequences is presented. The method is described in terms of a conceptual tree data structure for the sequences to be compared. The parallel algorithm shows efficient utilization of processors on an Encore Multimax computer in a sample comparison of 11 sequences totaling over 4000 bases. Timing data show the strong influence of computer system details on this parallel program. Also presented is a graphics program for displaying multiple sequence comparison output data. The display is capable of representing large volumes of multiple sequence comparison data in a single plot. The program has several additional features that allow closer examination of subsets of sequences. A display of matches from the sample comparison reflects the known structure of these sequences.

摘要

相似文献

1
Parallel computation of multiple biological sequence comparisons.
Comput Biomed Res. 1990 Aug;23(4):310-31. doi: 10.1016/0010-4809(90)90024-7.
2
Supercomputers and biological sequence comparison algorithms.
Comput Biomed Res. 1989 Dec;22(6):497-515. doi: 10.1016/0010-4809(89)90071-2.
3
A fast word search algorithm for the representation of sequence similarity in genomic DNA.一种用于表示基因组DNA序列相似性的快速词搜索算法。
Nucleic Acids Res. 1994 Feb 11;22(3):404-11. doi: 10.1093/nar/22.3.404.
4
Visualizing relationships between nucleic acid sequences using correlation images.使用相关性图像可视化核酸序列之间的关系。
Comput Appl Biosci. 1993 Jun;9(3):331-5. doi: 10.1093/bioinformatics/9.3.331.
5
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.一种在图形处理单元上使用 warp 混洗操作的基于莱文斯坦距离的并行近似字符串匹配。
PLoS One. 2017 Oct 10;12(10):e0186251. doi: 10.1371/journal.pone.0186251. eCollection 2017.
6
GPUDePiCt: A Parallel Implementation of a Clustering Algorithm for Computing Degenerate Primers on Graphics Processing Units.GPUDePiCt：一种用于在图形处理单元上计算简并引物的聚类算法的并行实现。
IEEE/ACM Trans Comput Biol Bioinform. 2015 Mar-Apr;12(2):445-54. doi: 10.1109/TCBB.2014.2355231.
7
A parallel computing approach to genetic sequence comparison: the master-worker paradigm with interworker communication.一种用于基因序列比较的并行计算方法：具有工作节点间通信的主从范式。
Comput Biomed Res. 1991 Apr;24(2):152-69. doi: 10.1016/0010-4809(91)90027-t.
8
Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm.并行计算与FASTA：面对快速序列比较算法中并行数据库搜索的问题。
Comput Appl Biosci. 1991 Jan;7(1):71-8. doi: 10.1093/bioinformatics/7.1.71.
9
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
Space efficient computation of rare maximal exact matches between multiple sequences.多个序列之间稀有最大精确匹配的空间高效计算。
J Comput Biol. 2008 May;15(4):357-77. doi: 10.1089/cmb.2007.0105.