Linear time algorithms for finding and representing all the tandem repeats in a string
type: Item
instance of: scholarly article
title: Linear time algorithms for finding and representing all the tandem repeats in a string
zbMATH Open document ID: 1076.68111
author: Dan Gusfield
author: Jens Stoye
published in: Journal of Computer and System Sciences
publication date: 2005-02-23T00:00:00Z
full work available at URL: https://pub.uni-bielefeld.de/record/1773569
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 2137320
MaRDI profile type: Publication
OpenAlex ID: W1967382114
cites work: Optimal off-line detection of repetitions in a string
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Q3673134
cites work: Transducers and repetitions
cites work: Q4849531
cites work: How many squares can a string contain?
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q3151169
cites work: On the Complexity of Finite Sequences
cites work: Detecting leftmost maximal periodicities
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Q3690246
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Linear Algorithm for Data Compression via String Matching
cites work: Simple and flexible detection of contiguous repeats using a suffix tree
cites work: On-line construction of suffix trees
DOI: 10.1016/J.JCSS.2004.03.004
description: scientific article; zbMATH DE number 2137320