{"title":"最短超弦问题的量子算法","authors":"K. Khadiev, C. Machado","doi":"10.1117/12.2624618","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the “Shortest Superstring Problem”(SSP) or the “Shortest Common Superstring Problem”(SCS). The problem is as follows. For a positive integer n, a sequence of n strings S = (s1, . . . , sn) is given. We should construct the shortest string t (we call it superstring) that contains each string from the given sequence as a substring. The problem is connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. We present a quantum algorithm with running time O∗(1.728n). Here O∗ notation does not consider polynomials of n and the length of t.","PeriodicalId":388511,"journal":{"name":"International Conference on Micro- and Nano-Electronics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Quantum algorithm for the shortest superstring problem\",\"authors\":\"K. Khadiev, C. Machado\",\"doi\":\"10.1117/12.2624618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the “Shortest Superstring Problem”(SSP) or the “Shortest Common Superstring Problem”(SCS). The problem is as follows. For a positive integer n, a sequence of n strings S = (s1, . . . , sn) is given. We should construct the shortest string t (we call it superstring) that contains each string from the given sequence as a substring. The problem is connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. We present a quantum algorithm with running time O∗(1.728n). Here O∗ notation does not consider polynomials of n and the length of t.\",\"PeriodicalId\":388511,\"journal\":{\"name\":\"International Conference on Micro- and Nano-Electronics\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Micro- and Nano-Electronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2624618\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Micro- and Nano-Electronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2624618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quantum algorithm for the shortest superstring problem
In this paper, we consider the “Shortest Superstring Problem”(SSP) or the “Shortest Common Superstring Problem”(SCS). The problem is as follows. For a positive integer n, a sequence of n strings S = (s1, . . . , sn) is given. We should construct the shortest string t (we call it superstring) that contains each string from the given sequence as a substring. The problem is connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. We present a quantum algorithm with running time O∗(1.728n). Here O∗ notation does not consider polynomials of n and the length of t.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
