{"title":"序列比对算法和最先进的比对器综述","authors":"Konstantinos Prousalis, Konstantinos Georgiou, Andreas Kalogeropoulos, Dimitrios Ntalaperas, Nikos Konofaos, Lefteris Aggelis, Christos Papalitsas, Thanos Stavropoulos, Nico Gariboldi","doi":"10.1145/3763229","DOIUrl":null,"url":null,"abstract":"Vast amounts of genomic, proteomic, transcriptomics and other forms, commonly referred to as -omics data, are generated daily in an unprecedented way thanks to high-throughput Next Generation Sequencing technologies. One of the main processes to generate value and insights from this data in bioinformatics is “sequence alignment”, an algorithmic routine that matches a “reference” sequence to a larger sequence. Despite the plethora of approaches, pairwise and multiple sequence alignment remain a complex problem that requires high computational power. In this paper, the most prominent sequence alignment approaches of the past three decades are reviewed and categorized, examining different aspects, such as their overall algorithmic synthesis, alignment quality and performance benchmarking tests in a uniform way. The latest trends reveal an increased specialization on biology-based directions, the need for alternative heuristic approaches and a promise in optics-enabled approaches and the quantum computing paradigm shift.","PeriodicalId":50926,"journal":{"name":"ACM Computing Surveys","volume":"13 1","pages":""},"PeriodicalIF":28.0000,"publicationDate":"2025-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Survey on Sequence Alignment Algorithms and State-of-the-Art Aligners\",\"authors\":\"Konstantinos Prousalis, Konstantinos Georgiou, Andreas Kalogeropoulos, Dimitrios Ntalaperas, Nikos Konofaos, Lefteris Aggelis, Christos Papalitsas, Thanos Stavropoulos, Nico Gariboldi\",\"doi\":\"10.1145/3763229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vast amounts of genomic, proteomic, transcriptomics and other forms, commonly referred to as -omics data, are generated daily in an unprecedented way thanks to high-throughput Next Generation Sequencing technologies. One of the main processes to generate value and insights from this data in bioinformatics is “sequence alignment”, an algorithmic routine that matches a “reference” sequence to a larger sequence. Despite the plethora of approaches, pairwise and multiple sequence alignment remain a complex problem that requires high computational power. In this paper, the most prominent sequence alignment approaches of the past three decades are reviewed and categorized, examining different aspects, such as their overall algorithmic synthesis, alignment quality and performance benchmarking tests in a uniform way. The latest trends reveal an increased specialization on biology-based directions, the need for alternative heuristic approaches and a promise in optics-enabled approaches and the quantum computing paradigm shift.\",\"PeriodicalId\":50926,\"journal\":{\"name\":\"ACM Computing Surveys\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":28.0000,\"publicationDate\":\"2025-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Computing Surveys\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3763229\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Computing Surveys","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3763229","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
A Survey on Sequence Alignment Algorithms and State-of-the-Art Aligners
Vast amounts of genomic, proteomic, transcriptomics and other forms, commonly referred to as -omics data, are generated daily in an unprecedented way thanks to high-throughput Next Generation Sequencing technologies. One of the main processes to generate value and insights from this data in bioinformatics is “sequence alignment”, an algorithmic routine that matches a “reference” sequence to a larger sequence. Despite the plethora of approaches, pairwise and multiple sequence alignment remain a complex problem that requires high computational power. In this paper, the most prominent sequence alignment approaches of the past three decades are reviewed and categorized, examining different aspects, such as their overall algorithmic synthesis, alignment quality and performance benchmarking tests in a uniform way. The latest trends reveal an increased specialization on biology-based directions, the need for alternative heuristic approaches and a promise in optics-enabled approaches and the quantum computing paradigm shift.
期刊介绍:
ACM Computing Surveys is an academic journal that focuses on publishing surveys and tutorials on various areas of computing research and practice. The journal aims to provide comprehensive and easily understandable articles that guide readers through the literature and help them understand topics outside their specialties. In terms of impact, CSUR has a high reputation with a 2022 Impact Factor of 16.6. It is ranked 3rd out of 111 journals in the field of Computer Science Theory & Methods.
ACM Computing Surveys is indexed and abstracted in various services, including AI2 Semantic Scholar, Baidu, Clarivate/ISI: JCR, CNKI, DeepDyve, DTU, EBSCO: EDS/HOST, and IET Inspec, among others.