对运行长度编码字符串的最短唯一回文子字符串查询

{"title":"对运行长度编码字符串的最短唯一回文子字符串查询","authors":"Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda","doi":"10.1007/978-3-030-25005-8_35","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings\",\"authors\":\"Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, H. Bannai, M. Takeda\",\"doi\":\"10.1007/978-3-030-25005-8_35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":403593,\"journal\":{\"name\":\"International Workshop on Combinatorial Algorithms\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Combinatorial Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-25005-8_35\",\"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 Workshop on Combinatorial Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-25005-8_35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}