论文信息 - Palindromic Decompositions with Gaps and Errors - 字舞流文

Palindromic Decompositions with Gaps and Errors

Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the ...

Panagiotis Charalampopoulos | Jakub Radoszewski | Mai Alzamel | Michal Adamczyk

[1] Valmir Carneiro Barbosa,et al. Finding approximate palindromes in strings , 2002, Pattern Recognit..

[2] Gregory Kucherov,et al. Searching for gapped palindromes , 2008, Theor. Comput. Sci..

[3] Rajesh Prasad,et al. Searching Gapped Palindromes in DNA Sequences using Dynamic Suffix Array , 2015 .

[4] Xavier Droubay,et al. Palindromes in the Fibonacci Word , 1995, Inf. Process. Lett..

[5] Zvi Galil,et al. A Linear-Time On-Line Recognition Algorithm for ``Palstar'' , 1978, JACM.

[6] Zvi Galil,et al. Parallel Detection of all Palindromes in a String , 1995, Theor. Comput. Sci..

[7] Kuan-Yu Chen,et al. Finding All Approximate Gapped Palindromes , 2010, Int. J. Found. Comput. Sci..

[8] Zvi Galil,et al. Finding all periods and initial palindromes of a string in parallel , 1992, Algorithmica.

[9] Glenn K. Manacher,et al. A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String , 1975, JACM.

[10] Anna E. Frid,et al. On palindromic factorization of words , 2013, Adv. Appl. Math..

[11] Juha Kärkkäinen,et al. A subquadratic algorithm for minimum palindromic factorization , 2014, J. Discrete Algorithms.

[12] Giuseppe Pirillo,et al. Palindromes and Sturmian Words , 1999, Theor. Comput. Sci..

[13] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..