Faster algorithms for computing maximal multirepeats in multiple sequences

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

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

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

suffix arraysbiological sequences

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (3)

• Space efficient search for maximal repetitions
• Computing regularities in strings: a survey
• On maximal repeats in strings

   Recommendations

• Efficient repeat finding in sets of strings via suffix arrays 👍 👎
• Fast, practical algorithms for computing all the repeats in a string 👍 👎
• Title not available (Why is that?) 👍 👎
• Space efficient search for maximal repetitions 👍 👎
• Title not available (Why is that?) 👍 👎

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)