{"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}
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..