Finding all the palindromes in a binary tree in linear time and space

DOI10.1016/0020-0190(92)90188-2MaRDI QIDQ1201867zbMATH OpenOpenAlexFDO

Authors Bettina De Iaco, Fabrizio Luccio

Publication date 17 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90188-2

zbMATH Keywords

design of algorithmspalindrometree matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Tight bound for the number of distinct palindromes in a tree
• Palindrome pattern matching
• Parallel detection of all palindromes in a string

Cites work

• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Fast Pattern Matching in Strings
• Finding all the palindromes in a binary tree in linear time and space
• scientific article; zbMATH DE number 3569815 (Why is no real title available?)
• Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

Cited in

(1)

• Finding all the palindromes in a binary tree in linear time and space

This page was built for publication: Finding all the palindromes in a binary tree in linear time and space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201867)