Faster algorithms for computing maximal multirepeats in multiple sequences

DOI10.3233/FI-2009-203MaRDI QIDQ3400580zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

biological sequencessuffix arrays

Mathematics Subject Classification ID

Algorithms on strings (68W32)

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

Cited in

(6)

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

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)