The subtree max gap problem with application to parallel string covering

DOI10.1006/INCO.1995.1162MaRDI QIDQ2508342zbMATH OpenOpenAlexFDO

Authors Omer Berkman, Costas S. Iliopoulos, Kunsoo Park

Publication date 10 October 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1162

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1003282
• scientific article; zbMATH DE number 4047160
• Parallel construction of a suffix tree with applications
• A note on the subtree isomorphism for ordered trees and related problems
• A work-time optimal algorithm for computing all string covers

Cited in

(14)

• Repetitive perhaps, but certainly not boring
• String covers of a tree
• On left and right seeds of a string
• Efficient seeds computation revisited
• scientific article; zbMATH DE number 1003282 (Why is no real title available?)
• Efficient seed computation revisited
• Algorithms For Computing Approximate Repetitions In Musical Sequences
• Generalized approximate regularities in strings
• Approximate periods of strings
• String Covering: A Survey
• String covers of a tree revisited
• Internal quasiperiod queries
• String 2-covers with no length restrictions
• Computing maximal-exponent factors in an overlap-free word

This page was built for publication: The subtree max gap problem with application to parallel string covering

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