Università di Pisa
Sistema bibliotecario di ateneo

Bases of Motifs for Generating Repeated Patterns with Don't Cares

Pisanti, Nadia and Crochemore, Maxime and Grossi, Roberto and Sagot, Marie-France (2003) Bases of Motifs for Generating Repeated Patterns with Don't Cares. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (191Kb)


    We investigate the problem of determining the basis of repeated motifs with don't cares in an input string. We give new upper and lower bounds on the problem, introducing a new notion of basis that is provably smaller than (and contained in) previously defined ones. Our basis can be computed in less time and space, and is still able to generate the same set of motifs. We also prove that the number of motifs in all these bases grows exponentially with the quorum, the minimal number of times a motif must appear, which was unnoticed in previous work. We show that a polynomial-time algorithm exists only for fixed quorum.

    Item Type: Book
    Uncontrolled Keywords: string algorithmics, pattern discovery, repetitions, motifs, don't cares
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 17 Dec 2014 16:32
    Last Modified: 17 Dec 2014 16:32
    URI: http://eprints.adm.unipi.it/id/eprint/2090

    Repository staff only actions

    View Item