{"title":"最长间隔重复和回文","authors":"Marius Dumitran, Paweł Gawrychowski, F. Manea","doi":"10.23638/DMTCS-19-4-4","DOIUrl":null,"url":null,"abstract":"A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, \\(u^Rvu\\)) of w. We show how to compute efficiently, for every position i of the word w, the longest prefix u of w[i..n] such that uv (respectively, \\(u^Rv\\)) is a suffix of \\(w[1..i-1]\\) (defining thus a gapped repeat uvu – respectively, palindrome \\(u^Rvu\\)), and the length of v is subject to various types of restrictions.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Longest Gapped Repeats and Palindromes\",\"authors\":\"Marius Dumitran, Paweł Gawrychowski, F. Manea\",\"doi\":\"10.23638/DMTCS-19-4-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, \\\\(u^Rvu\\\\)) of w. We show how to compute efficiently, for every position i of the word w, the longest prefix u of w[i..n] such that uv (respectively, \\\\(u^Rv\\\\)) is a suffix of \\\\(w[1..i-1]\\\\) (defining thus a gapped repeat uvu – respectively, palindrome \\\\(u^Rvu\\\\)), and the length of v is subject to various types of restrictions.\",\"PeriodicalId\":55175,\"journal\":{\"name\":\"Discrete Mathematics and Theoretical Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2015-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Theoretical Computer Science\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.23638/DMTCS-19-4-4\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.23638/DMTCS-19-4-4","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, \(u^Rvu\)) of w. We show how to compute efficiently, for every position i of the word w, the longest prefix u of w[i..n] such that uv (respectively, \(u^Rv\)) is a suffix of \(w[1..i-1]\) (defining thus a gapped repeat uvu – respectively, palindrome \(u^Rvu\)), and the length of v is subject to various types of restrictions.
期刊介绍：
DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network.
Sections of DMTCS
Analysis of Algorithms
Automata, Logic and Semantics
Combinatorics
Discrete Algorithms
Distributed Computing and Networking
Graph Theory.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
