在线性时间内逼近最长公共子序列:突破$\sqrt{{n}}$障碍

{"title":"在线性时间内逼近最长公共子序列:突破$\\sqrt{{n}}$障碍","authors":"M. Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun","doi":"10.1137/19m1272068","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"31 1","pages":"1341-1367"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximating Longest Common Subsequence in Linear Time: Beating the $\\\\sqrt{{n}}$ Barrier\",\"authors\":\"M. Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun\",\"doi\":\"10.1137/19m1272068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":21812,\"journal\":{\"name\":\"SIAM J. Sci. Comput.\",\"volume\":\"31 1\",\"pages\":\"1341-1367\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM J. Sci. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/19m1272068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Sci. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/19m1272068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}