Fast, practical algorithms for computing all the repeats in a string
From MaRDI portal
Publication:626893
DOI10.1007/S11786-010-0033-6zbMATH Open1205.68496OpenAlexW2067675443MaRDI QIDQ626893FDOQ626893
Authors: Simon J. Puglisi, W. F. Smyth, Munina Yusufu 
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/36774
Recommendations
- Fast and Practical Algorithms for Computing All the Runs in a String
- scientific article; zbMATH DE number 2105037
- Efficient repeat finding in sets of strings via suffix arrays
- Faster algorithms for computing maximal multirepeats in multiple sequences
- An O(n log n) algorithm for finding all repetitions in a string
Permutations, words, matrices (05A05) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Space efficient linear time construction of suffix arrays
- Title not available (Why is that?)
- Replacing suffix trees with enhanced suffix arrays
- Engineering a lightweight suffix array construction algorithm
- Algorithm Theory - SWAT 2004
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays
- Title not available (Why is that?)
- Fast, practical algorithms for computing all the repeats in a string
- New approaches for computer analysis of nucleic acid sequences.
Cited In (14)
- Efficient repeat finding in sets of strings via suffix arrays
- On context-diverse repeats and their incremental computation
- New complexity results for the \(k\)-covers problem
- Title not available (Why is that?)
- Computing regularities in strings: a survey
- String covering with optimal covers
- Simple and flexible detection of contiguous repeats using a suffix tree
- Faster algorithms for computing maximal multirepeats in multiple sequences
- Fast algorithm for Vernier search of long repeats in DNA sequences with bounded error density
- Title not available (Why is that?)
- Fast algorithms for finding a minimum repetition representation of strings and trees
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- Fast, practical algorithms for computing all the repeats in a string
- Efficient computation of substring equivalence classes with suffix arrays
This page was built for publication: Fast, practical algorithms for computing all the repeats in a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626893)
