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 条
  • [21] On stabbing queries for generalised longest repeats
    Xu, Bojian
    INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 2016, 15 (04) : 350 - 371
  • [22] Efficiently Finding All Maximal α-gapped Repeats
    Gawrychowski, Pawel
    Tomohiro, I
    Inenaga, Shunsuke
    Koeppl, Dominik
    Manea, Florin
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [23] Computing longest common substring and all palindromes from compressed strings
    Matsubara, Wataru
    Inenaga, Shunsuke
    Ishino, Akira
    Shinohara, Ayumi
    Nakamura, Tomoyuki
    Hashimoto, Kazuo
    SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 364 - +
  • [24] Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
    Paweł Gawrychowski
    Oleg Merkurev
    Arseny M. Shur
    Przemysław Uznański
    Algorithmica, 2019, 81 : 3630 - 3654
  • [25] Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
    Gawrychowski, Pawel
    Merkurev, Oleg
    Shur, Arseny M.
    Uznanski, Przemyslaw
    ALGORITHMICA, 2019, 81 (09) : 3630 - 3654
  • [26] Efficient algorithms to compute compressed longest common substrings and compressed palindromes
    Matsubara, Wataru
    Inenaga, Shunsuke
    Ishino, Akira
    Shinohara, Ayumi
    Nakamura, Tomoyuki
    Hashimoto, Kazuo
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 900 - 913
  • [27] Searching gapped palindromes in DNA sequences using Burrows Wheeler type transformation
    Gupta, Shivika
    Prasad, Rajesh
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2016, 37 (01): : 51 - 74
  • [28] Longest repeats with a block of don't cares
    Crochemore, M
    Iliopoulos, CS
    Mohamed, M
    Sagot, MF
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 271 - 278
  • [29] A Faster Algorithm for Computing Maximal α-gapped Repeats in a String
    Tanimura, Yuka
    Fujishige, Yuta
    Tomohiro, I
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2015), 2015, 9309 : 124 - 136
  • [30] Finding the gapped longest common subsequence by incremental suffix maximum queries
    Peng, Yung-Hsing
    Yang, Chang-Biau
    INFORMATION AND COMPUTATION, 2014, 237 : 95 - 100
12345