分子生物学中的序列比对

A. Apostolico, R. Giancarlo
{"title":"分子生物学中的序列比对","authors":"A. Apostolico, R. Giancarlo","doi":"10.1090/dimacs/047/05","DOIUrl":null,"url":null,"abstract":"Molecular biology is a computationally intense realm of contemporary science and faces some of the current grand scientific challenges. In its context, tools that identify, store, compare and analyze effectively large and growing numbers of bio-sequences are found of increasingly crucial importance. Biosequences are routinely compared or aligned, in a variety of ways, to infer common ancestry, to detect functional equivalence, or simply while searching for similar entries in a database. A considerable body of knowledge has accumulated on sequence alignment during the past few decades. Without pretending to be exhaustive, this paper attempts a survey of some criteria of wide use in sequence alignment and comparison problems, and of the corresponding solutions. The paper is based on presentations and literature given at the Workshop on Sequence Alignment held at Princeton, N.J., in November 1994, as part of the DIMACS Special Year on Mathematical Support for Molecular Biology. \"Dipartimento di Elettronica e Informatica, Universita. di Padova, Via Gradenigo 6/A, 35131 Padova, Italy, (3949)828-7710; axa@arLdei.unipd.iti partially supported by NSF grant CCR_92_01078, by NATO grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM). IDipartimento di Matcmatica, University of Palermo, Via Archirafi 34, 90123 Palermo, ItalYi raffaelc@altair.math.unipa.it; partially supported by MURST Grant \"Algoritmi, Strutture di Calcolo e Sistemi Informativin; part of this work was done while the author was visiting AT&T Bell Labs., Murray Hill, NJ. > U.S.A..","PeriodicalId":175691,"journal":{"name":"Mathematical Support for Molecular Biology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Sequence alignment in molecular biology\",\"authors\":\"A. Apostolico, R. Giancarlo\",\"doi\":\"10.1090/dimacs/047/05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Molecular biology is a computationally intense realm of contemporary science and faces some of the current grand scientific challenges. In its context, tools that identify, store, compare and analyze effectively large and growing numbers of bio-sequences are found of increasingly crucial importance. Biosequences are routinely compared or aligned, in a variety of ways, to infer common ancestry, to detect functional equivalence, or simply while searching for similar entries in a database. A considerable body of knowledge has accumulated on sequence alignment during the past few decades. Without pretending to be exhaustive, this paper attempts a survey of some criteria of wide use in sequence alignment and comparison problems, and of the corresponding solutions. The paper is based on presentations and literature given at the Workshop on Sequence Alignment held at Princeton, N.J., in November 1994, as part of the DIMACS Special Year on Mathematical Support for Molecular Biology. \\\"Dipartimento di Elettronica e Informatica, Universita. di Padova, Via Gradenigo 6/A, 35131 Padova, Italy, (3949)828-7710; axa@arLdei.unipd.iti partially supported by NSF grant CCR_92_01078, by NATO grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM). IDipartimento di Matcmatica, University of Palermo, Via Archirafi 34, 90123 Palermo, ItalYi raffaelc@altair.math.unipa.it; partially supported by MURST Grant \\\"Algoritmi, Strutture di Calcolo e Sistemi Informativin; part of this work was done while the author was visiting AT&T Bell Labs., Murray Hill, NJ. > U.S.A..\",\"PeriodicalId\":175691,\"journal\":{\"name\":\"Mathematical Support for Molecular Biology\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Support for Molecular Biology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/047/05\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Support for Molecular Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/047/05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

摘要

分子生物学是当代科学的一个计算密集型领域,面临着当前一些重大的科学挑战。在这种情况下,识别、存储、比较和有效分析大量和不断增长的生物序列的工具变得越来越重要。生物序列通常以各种方式进行比较或对齐,以推断共同的祖先,检测功能等效,或者只是在数据库中搜索相似的条目。在过去的几十年中,在序列比对方面积累了相当多的知识。本文试图对序列比对和比较问题中广泛使用的一些准则进行综述,并给出相应的解决方法。这篇论文是根据1994年11月在新泽西州普林斯顿举行的序列比对研讨会上的报告和文献编写的,该研讨会是DIMACS分子生物学数学支持特别年的一部分。“香港大学电子与信息学系。di Padova, Via Gradenigo 6/A, 35131 Padova, Italy, (3949)828-7710;axa@arLdei.unipd.iti部分由美国国家科学基金会资助CCR_92_01078,北约资助CRG 900293,意大利国家研究委员会和欧盟ESPRIT III基础研究计划(合同编号9072)(GEPPCOM项目)支持。Palermo大学数学学院,Palermo archafi大街34号,90123 Palermo, italy raffaelc@altair.math.unipa.it;部分由MURST资助“算法、结构、Calcolo和系统信息”;部分工作是在作者访问AT&T贝尔实验室时完成的。新泽西州默里山>美国. .
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sequence alignment in molecular biology
Molecular biology is a computationally intense realm of contemporary science and faces some of the current grand scientific challenges. In its context, tools that identify, store, compare and analyze effectively large and growing numbers of bio-sequences are found of increasingly crucial importance. Biosequences are routinely compared or aligned, in a variety of ways, to infer common ancestry, to detect functional equivalence, or simply while searching for similar entries in a database. A considerable body of knowledge has accumulated on sequence alignment during the past few decades. Without pretending to be exhaustive, this paper attempts a survey of some criteria of wide use in sequence alignment and comparison problems, and of the corresponding solutions. The paper is based on presentations and literature given at the Workshop on Sequence Alignment held at Princeton, N.J., in November 1994, as part of the DIMACS Special Year on Mathematical Support for Molecular Biology. "Dipartimento di Elettronica e Informatica, Universita. di Padova, Via Gradenigo 6/A, 35131 Padova, Italy, (3949)828-7710; axa@arLdei.unipd.iti partially supported by NSF grant CCR_92_01078, by NATO grant CRG 900293, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (Project GEPPCOM). IDipartimento di Matcmatica, University of Palermo, Via Archirafi 34, 90123 Palermo, ItalYi raffaelc@altair.math.unipa.it; partially supported by MURST Grant "Algoritmi, Strutture di Calcolo e Sistemi Informativin; part of this work was done while the author was visiting AT&T Bell Labs., Murray Hill, NJ. > U.S.A..
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信