Show simple item record

dc.contributor.authorIliopoulos, Costas
dc.contributor.authorSmyth, Bill
dc.contributor.authorYusufu, M.
dc.identifier.citationIliopoulos, Costas and Smyth, W. F. and Yusufu, Munina. 2009. Faster algorithms for computing maximal multirepeats in multiple sequences. Fundamenta Informaticae. 97 (3): pp. 311-320.

A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin greater than/equal to 2) in each of at least q greater than/equal to 1 strings in a given set of strings. In this paper, we describe a family of efficient algorithms based on suffix arrays to compute maximal multirepeats under various constraints. Our algorithms are faster, more flexible and much more space-efficient than algorithms recently proposed for this problem. The results extend recent work by two of the authors computing all maximal repeats in a single string.

dc.publisherIOS Press
dc.subjectmaximal multirepeats
dc.subjectbiological sequences
dc.subjectsuffix arrays
dc.titleFaster algorithms for computing maximal multirepeats in multiple sequences
dc.typeJournal Article
dcterms.source.titleFundamenta Informaticae
curtin.departmentDigital Ecosystems and Business Intelligence Institute (DEBII)
curtin.accessStatusOpen access
curtin.facultyCurtin Business School
curtin.facultyThe Digital Ecosystems and Business Intelligence Institute (DEBII)

Files in this item


This item appears in the following Collection(s)

Show simple item record