Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

DOI10.3233/FI-2009-203zbMath1189.68180OpenAlexW1554777263MaRDI QIDQ3400580

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

biological sequencessuffix arrays

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Computing regularities in strings: a survey