Longest Gapped Repeats and Palindromes

被引:10
|
作者
Dumitran, Marius [1 ]
Manea, Florin [2 ]
机构
[1] Univ Bucharest, Fac Math & Comp Sci, Bucharest 010014, Romania
[2] Univ Kiel, Dept Comp Sci, Christian Albrechts Pl 4, D-24118 Kiel, Germany
来源
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I | 2015年 / 9234卷
关键词
ALGORITHM;
D O I
10.1007/978-3-662-48057-1_16
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, u(R)vu) 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(R)v) is a suffix of w[1.. i - 1] (defining thus a gapped repeat uvu - respectively, palindrome u R vu), and the length of v is subject to various types of restrictions.
引用
收藏
页码:205 / 217
页数:13
相关论文
共 50 条
  • [41] 'Palindromes'
    Rayns, T
    SIGHT AND SOUND, 2005, 15 (05): : 72 - +
  • [42] 'Palindromes'
    不详
    CINEFORUM, 2004, 44 (09): : 53 - 53
  • [43] Block Palindromes: A New Generalization of Palindromes
    Goto, Keisuke
    Tomohiro, I.
    Bannai, Hideo
    Inenaga, Shunsuke
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018, 2018, 11147 : 183 - 190
  • [44] PALINDROMES
    MARTIN, HM
    DR DOBBS JOURNAL, 1994, 19 (05): : 10 - 10
  • [45] PALINDROMES
    FERGUSON, J
    VERBATIM, 1986, 12 (04): : 11 - 12
  • [46] 'PALINDROMES'
    INEZ, C
    CHICAGO REVIEW, 1976, 27 (04) : 47 - 47
  • [47] Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices
    Sagot, MF
    Viari, A
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1997, 1264 : 224 - 246
  • [48] 'Palindromes'
    Baumann, F
    POSITIF, 2005, (529): : 27 - 28
  • [49] PALINDROMES
    QUEEN, CS
    FIBONACCI QUARTERLY, 1993, 31 (03): : 216 - 226
  • [50] Palindromes
    石铁
    语数外学习(高中版高一年级), 2007, (05) : 60 - 60