Efficient repeat finding in sets of strings via suffix arrays

MaRDI QIDQ5747388zbMATH OpenFDO

Authors Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber

Publication date 14 February 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2130/0.html

zbMATH Keywords

longest maximal substringrepeatsstringologysuffix array

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Faster algorithms for computing maximal multirepeats in multiple sequences
• Fast, practical algorithms for computing all the repeats in a string
• scientific article; zbMATH DE number 2105037
• Computing Longest Common Substrings Via Suffix Arrays
• Fast and Practical Algorithms for Computing All the Runs in a String

Cited in

(9)

• Faster algorithms for computing maximal multirepeats in multiple sequences
• Computing Longest Common Substrings Via Suffix Arrays
• scientific article; zbMATH DE number 1945184 (Why is no real title available?)
• scientific article; zbMATH DE number 2105037 (Why is no real title available?)
• Alphabet-independent algorithms for finding context-sensitive repeats in linear time
• Algorithms – ESA 2005
• Space efficient search for maximal repetitions
• Simple and flexible detection of contiguous repeats using a suffix tree
• Fast, practical algorithms for computing all the repeats in a string

This page was built for publication: Efficient repeat finding in sets of strings via suffix arrays

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