Linear time algorithms for generalizations of the longest common substring problem

DOI10.1007/s00453-009-9369-1zbMath1219.68126OpenAlexW2050884984MaRDI QIDQ547294

Yong-Cai Geng, Sumit K. Garg

Publication date: 1 July 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9369-1

zbMATH Keywords

longest common substringsuffix arraysstring mininglongest common repeatrepeat analysis

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

Inducing enhanced suffix arrays for string collections ⋮ A simple algorithm for computing the document array

Cites Work

• Linear time algorithm for the longest common repeat problem
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Recursive Star-Tree Parallel Data Structure
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear time algorithms for generalizations of the longest common substring problem