Faster algorithms for computing maximal multirepeats in multiple sequences

DOI10.3233/FI-2009-203zbMATH Open1189.68180OpenAlexW1554777263MaRDI QIDQ3400580FDOQ3400580

Authors: Costas S. Iliopoulos, W. F. Smyth, Munina Yusufu 

Publication date: 5 February 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-203

Recommendations

• Efficient repeat finding in sets of strings via suffix arrays
• Fast, practical algorithms for computing all the repeats in a string
• scientific article; zbMATH DE number 2105037
• Space efficient search for maximal repetitions
• scientific article; zbMATH DE number 2051171

zbMATH Keywords

suffix arraysbiological sequences

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (6)

• Efficient repeat finding in sets of strings via suffix arrays
• On context-diverse repeats and their incremental computation
• Space efficient search for maximal repetitions
• Computing regularities in strings: a survey
• Fast, practical algorithms for computing all the repeats in a string
• On maximal repeats in strings

This page was built for publication: Faster algorithms for computing maximal multirepeats in multiple sequences

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