Concepedia

Palindrome Algorithms

Palindrome Algorithms is a class of string processing algorithms designed to identify, generate, or analyze palindromic substrings or sequences within textual data, distinguished by their specific focus on symmetry-based patterns in linear character arrangements.

31

Publications

4.2K

Citations

87

Authors

56

Institutions

Publications per year

2017–2026

7

Parents

Publications

31

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations

, , +12

The p53MH algorithm and its application in detecting p53-responsive genes

J. Hoh, Shengkan Jin, Tony Parrado et al. · Proceedings of the National Academy of Sciences · 2002 · 299 citations · Full text

, , +13

A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

Glenn K. Manacher · Journal of the ACM · 1975 · 150 citations · Full text

, , +6

Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences

Václav Brázda, Jan Kolomazník, Jiří Lýsek et al. · Biochemical and Biophysical Research Communications · 2016 · 87 citations

, , +15

Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino et al. · Theoretical Computer Science · 2008 · 65 citations

, , +8

1–5 of 31

Authors

87

  1. ZG
    Zvi Galil

    Tel Aviv University, Israel

    5 publications · 177 citations

    5

    h-index

  2. SI
    Shunsuke Inenaga

    Kyushu University, Japan

    3 publications · 105 citations

    3

    h-index

  3. DB
    Dany Breslauer

    Danish National Research Foundation, Denmark

    3 publications · 121 citations

    3

    h-index

  4. LA
    Lorraine A. K. Ayad

    King's College London, United Kingdom

    2 publications · 30 citations

    2

    h-index

  5. RG
    Roberto Grossi

    University of Pisa, Italy

    2 publications · 30 citations

    2

    h-index

1–5 of 87

Institutions

56

  1. Tel Aviv University

    Tel Aviv, Israel

    3 h-index

    3 publications

    124 citations

  2. Kyushu University

    Fukuoka, Japan

    3 h-index

    8 publications

    180 citations

  3. Columbia University

    New York, United States

    3 h-index

    3 publications

    138 citations

  4. University of Pisa

    Pisa, Italy

    2 h-index

    6 publications

    90 citations

  5. University of Waterloo

    Waterloo, Canada

    2 h-index

    10 publications

    144 citations

  6. Institut national de recherche en sciences et technologies du numérique

    Le Chesnay-Rocquencourt, France

    2 h-index

    3 publications

    87 citations

  7. University of Milano-Bicocca

    Milan, Italy

    2 h-index

    2 publications

    30 citations

  8. King's College London

    London, United Kingdom

    2 h-index

    7 publications

    105 citations

1–8 of 56

Venues

  1. Theoretical Computer Science

    4 publications · 191 citations

    4

    h-index

  2. Algorithmica

    3 publications · 90 citations

    3

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 27 citations

    2

    h-index

  4. Fundamenta Informaticae

    2 publications · 45 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 54 citations

    2

    h-index

1–5